New length bounds for cycle bases (Q2380021): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2934632 / 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: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Small-Stretch Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Generating Fundamental Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-stretch spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: New length bounds for cycle bases / 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: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Algorithms for Minimum Cycle Bases of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cycle bases / rank
 
Normal rank

Latest revision as of 15:25, 2 July 2024

scientific article
Language Label Description Also known as
English
New length bounds for cycle bases
scientific article

    Statements

    New length bounds for cycle bases (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    approximation algorithms
    0 references
    cycle bases
    0 references
    metric approximation
    0 references
    0 references