Finding Even Cycles Even Faster
From MaRDI portal
Publication:4337730
DOI10.1137/S0895480194274133zbMATH Open0867.05065OpenAlexW2131676402MaRDI QIDQ4337730FDOQ4337730
Authors: Raphael Yuster, Uri Zwick 
Publication date: 26 May 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480194274133
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cited In (29)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- How many attackers can selfish defenders catch?
- Finding and counting given length cycles
- Finding even cycles faster via capped k-walks
- Counting Homomorphic Cycles in Degenerate Graphs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Title not available (Why is that?)
- Map graphs having witnesses of large girth
- Two-dimensional pattern matching against local and regular-like picture languages
- Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs
- Finding shorter cycles in a weighted graph
- On the negative cost girth problem in planar networks
- Computational complexity aspects of super domination
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Detecting directed 4-cycles still faster
- A shortest cycle for each vertex of a graph
- Finding and counting small tournaments in large tournaments
- Removing additive structure in 3SUM-based reductions
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- Answering conjunctive queries with inequalities
- Equitable total-coloring of subcubic graphs
- Title not available (Why is that?)
- An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs
- Finding a shortest cycle in a subspace of the cycle space of a graph
- Title not available (Why is that?)
This page was built for publication: Finding Even Cycles Even Faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337730)
