Browsing by Subject "Bounded treewidth"
Now showing items 1-1 of 1
-
(Elsevier, 2018-07-10)For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices in H is the same in H as in G. A distance-preserving elimination ordering of G is a total ordering of its vertex-set V ...