The following pages link to Finding Even Cycles Even Faster (Q4337730):
Displaying 23 items.
- Finding a shortest cycle in a subspace of the cycle space of a graph (Q668125) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- A shortest cycle for each vertex of a graph (Q1944201) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Answering conjunctive queries with inequalities (Q2402612) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
- An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs (Q2826672) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Finding even cycles faster via capped k-walks (Q4977965) (← links)
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
- (Q5089153) (← links)
- (Q5743440) (← links)
- Finding shorter cycles in a weighted graph (Q5964975) (← links)
- (Q6065422) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
- Finding and counting small tournaments in large tournaments (Q6652454) (← links)
