A shortest cycle for each vertex of a graph
From MaRDI portal
Publication:1944201
DOI10.1016/J.IPL.2011.07.019zbMATH Open1260.05083OpenAlexW2071406157MaRDI QIDQ1944201FDOQ1944201
Authors: Raphael Yuster 
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.019
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Color-coding
- Approximating the girth
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
- Matrix multiplication via arithmetic progressions
- More algorithms for all-pairs shortest paths in weighted graphs
- Disjoint paths in a network
- Finding a Minimum Circuit in a Graph
- A quick method for finding shortest pairs of disjoint paths
- Finding Even Cycles Even Faster
Cited In (10)
- Improved distance queries and cycle counting by Frobenius normal form
- Detecting cycles through three fixed vertices in a graph
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- Title not available (Why is that?)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Removing additive structure in 3SUM-based reductions
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Title not available (Why is that?)
This page was built for publication: A shortest cycle for each vertex of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944201)
