Finding Even Cycles Even Faster
From MaRDI portal
Publication:4337730
DOI10.1137/S0895480194274133zbMath0867.05065OpenAlexW2131676402MaRDI QIDQ4337730
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
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Map graphs having witnesses of large girth, Answering conjunctive queries with inequalities, Counting Homomorphic Cycles in Degenerate Graphs, On the negative cost girth problem in planar networks, Computational complexity aspects of super domination, Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs, A shortest cycle for each vertex of a graph, Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths, Unnamed Item, How many attackers can selfish defenders catch?, Finding a shortest cycle in a subspace of the cycle space of a graph, Finding and counting given length cycles, Unnamed Item, Efficient approximation algorithms for shortest cycles in undirected graphs, Two-dimensional pattern matching against local and regular-like picture languages, Finding shorter cycles in a weighted graph, Detecting directed 4-cycles still faster, An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs, Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs, Linear time algorithms for finding a dominating set of fixed size in degenerated graphs, Equitable total-coloring of subcubic graphs, Unnamed Item
