Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrzej Lingas / rank
Normal rank
 
Property / author
 
Property / author: Andrzej Lingas / rank
 
Normal rank
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/978-3-540-78773-0_63 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1781409509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Approximation of Distances in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More algorithms for all-pairs shortest paths in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Small-Stretch Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / 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: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Q2921712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Cycles: Integrality Gap, Hardness, and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding even cycles even faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796165 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:23, 27 June 2024

scientific article; zbMATH DE number 5263953
Language Label Description Also known as
English
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
scientific article; zbMATH DE number 5263953

    Statements

    Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (English)
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    0 references
    0 references