New approximation algorithms for minimum cycle bases of graphs (Q633843): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cycle bases for network graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / 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: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to compute minimum cycle basis in directed graphs / 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: An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs which approximate the complete Euclidean graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cycle bases of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approach to compute a minimum cycle basis of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of cycle bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weakly fundamental cycle bases are hard to find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 21:49, 3 July 2024

scientific article
Language Label Description Also known as
English
New approximation algorithms for minimum cycle bases of graphs
scientific article

    Statements

    New approximation algorithms for minimum cycle bases of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2011
    0 references
    cycle space
    0 references
    cycle basis
    0 references
    approximation algorithms
    0 references
    graphs
    0 references
    spanners
    0 references
    fast matrix multiplication
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references