An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-013-9765-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012939398 / rank
 
Normal rank
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: Chordality properties on graphs and minimal conceptual connections in semantic data models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934633 / 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: Q3993087 / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distance approximating trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and distance and routing labeling schemes for hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive sparse spanners for graphs with bounded length of largest induced cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners for bounded tree-length graphs / 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 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: Lower-Stretch Spanning Trees / 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: Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal 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: Dynamic analysis of the arrow distributed protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree 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: 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 minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank

Latest revision as of 08:19, 9 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
scientific article

    Statements

    An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    0 references
    graph algorithms
    0 references
    approximation algorithms
    0 references
    tree \(t\)-spanner problem
    0 references
    minimum max-stretch spanning tree problem
    0 references
    generalized chordal graphs
    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