Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordality properties on graphs and minimal conceptual connections in semantic data models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation for the Directed Spanner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836515 / 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 for bipartite graphs and probe interval graphs / 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed spanners via flow-based linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-decompositions with bags of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners for bounded tree-length graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences / 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: Collective tree spanners in graphs with bounded parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective Tree Spanners and Routing in AT-free Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree spanners of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of minimum weight spanners for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the sparsest 2-spanner of 4-connected planar triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>(1 + εΒ)</i> -spanner constructions for general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-spanner problems for \(k>2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-Stretch Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Max-Stretch Spanning Trees on Unweighted 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: A Separator Theorem for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling with a Pez Dispenser (or, Routing Issues in MPLS) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic analysis of the arrow distributed protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Sparse 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zoo of tree spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing treelength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708559 / 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: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance approximating spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Spanners in Nearly Quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and low delay routing labeling scheme for unit disk graphs / rank
 
Normal rank

Latest revision as of 19:50, 8 July 2024

scientific article
Language Label Description Also known as
English
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
scientific article

    Statements

    Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (English)
    0 references
    0 references
    0 references
    25 July 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    approximation algorithms
    0 references
    tree spanner problem
    0 references
    collective tree spanners
    0 references
    spanners of bounded tree-width
    0 references
    Robertson-Seymour's tree-decomposition
    0 references
    balanced separators
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references