On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On distance-preserving elimination orderings in graphs: complexity and algorithms |
scientific article; zbMATH DE number 6872387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On distance-preserving elimination orderings in graphs: complexity and algorithms |
scientific article; zbMATH DE number 6872387 |
Statements
On distance-preserving elimination orderings in graphs: complexity and algorithms (English)
0 references
24 May 2018
0 references
distance-preserving elimination ordering
0 references
metric graph theory
0 references
NP-completeness
0 references
exact exponential algorithm
0 references
integer linear programming
0 references
bounded treewidth
0 references
