Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868): 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.1016/j.tcs.2005.05.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172159738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / 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: Q4373672 / 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: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose neighborhoods have no special cycles / 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: Q4448751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence graphs of biacyclic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners in planar 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: Q3328583 / 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: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / 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: Distributed Computing: A Locality-Sensitive Approach / 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: Q3139291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of minimum spanner problems / rank
 
Normal rank

Latest revision as of 13:30, 11 June 2024

scientific article
Language Label Description Also known as
English
Additive sparse spanners for graphs with bounded length of largest induced cycle
scientific article

    Statements

    Additive sparse spanners for graphs with bounded length of largest induced cycle (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2005
    0 references
    additive graph spanners
    0 references
    efficient algorithms
    0 references
    \(k\)-chordal graphs
    0 references
    distance
    0 references

    Identifiers