Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871197 | Discrete Applied Mathematics | 2018 | 14 Pages |
Abstract
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(G), denoted (v1,v2,â¦,vn), such that any subgraph Gi=Gâ(v1,v2,â¦,vi) with 1â¤i
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto,