On distance-preserving elimination orderings in graphs: Complexity and algorithms - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2018

## On distance-preserving elimination orderings in graphs: Complexity and algorithms

(1) , (2, 3) , (1) , (4)
1
2
3
4
David Coudert
Guillaume Ducoffe
Nicolas Nisse
Mauricio Soto
• Function : Author

#### 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 (v 1 , v 2 ,. .. , v n), such that any subgraph G i = G\(v 1 , v 2 ,. .. , v i) with 1 ≤ i < n is isometric. This kind of ordering has been introduced by Chepoi in his study on weakly modular graphs [11]. We prove that it is NP-complete to decide whether such ordering exists for a given graph — even if it has diameter at most 2. Then, we prove on the positive side that the problem of computing a distance-preserving ordering when there exists one is fixed-parameter-tractable in the treewidth. Lastly, we describe a heuristic in order to compute a distance-preserving ordering when there exists one that we compare to an exact exponential time algorithm and to an ILP formulation for the problem.

### Dates and versions

hal-01741277 , version 1 (22-03-2018)

### Identifiers

• HAL Id : hal-01741277 , version 1
• DOI :

### Cite

David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto. On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discrete Applied Mathematics, 2018, 243, pp.140-153. ⟨10.1016/j.dam.2018.02.007⟩. ⟨hal-01741277⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

232 View