An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-007-9064-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124619812 / 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: All-Pairs Small-Stretch Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / 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: All pairs shortest paths for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Path Bases / 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: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088851 / 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: Q3907595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected single-source shortest paths with positive integer weights in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floats, Integers, and Single Source Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615283 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:06, 29 June 2024

scientific article
Language Label Description Also known as
English
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
scientific article

    Statements

    An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2009
    0 references
    Cycle basis
    0 references
    Cycle space
    0 references
    Matrix multiplication
    0 references
    Polynomial algorithms
    0 references

    Identifiers