Tree spanners of bounded degree graphs (Q1693164): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2017.10.025 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1503.06822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar spanners and approximate shortest path queries among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Approximating Trees for Chordal and Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners on chordal graphs: complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal tree 3-spanners in directed path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree 3-spanners on interval, permutation and regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree \(t\)-spanners in outerplanar graphs via supply demand partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating tree spanners that are breadth first search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low complexity variants of the arrow distributed directory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the distortion of embedding finite metric spaces in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of minimum spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2017.10.025 / rank
 
Normal rank

Latest revision as of 04:06, 11 December 2024

scientific article
Language Label Description Also known as
English
Tree spanners of bounded degree graphs
scientific article

    Statements

    Tree spanners of bounded degree graphs (English)
    0 references
    11 January 2018
    0 references
    tree spanner
    0 references
    distance
    0 references
    spanning tree
    0 references
    efficient graph algorithm
    0 references
    bounded degree graph
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references