On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455)

From MaRDI portal
Revision as of 20:03, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On distance-preserving elimination orderings in graphs: complexity and algorithms
scientific article

    Statements

    On distance-preserving elimination orderings in graphs: complexity and algorithms (English)
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references