An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092): 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/978-3-642-22935-0_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1860059046 / 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: Q2934633 / 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: 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: Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs / 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: 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: 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: 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 10:18, 4 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
    17 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references