Pages that link to "Item:Q1052821"
From MaRDI portal
The following pages link to The complexity of determining a shortest cycle of even length (Q1052821):
Displaying 13 items.
- The cycle's structure of embedded graphs in surfaces (Q277096) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Finding a shortest cycle in a subspace of the cycle space of a graph (Q668125) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- On fractional cut covers (Q2312658) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Determination of a circuit in a directed graph (Q3779761) (← links)
- Finding even cycles even faster (Q4632454) (← links)
- Finding shorter cycles in a weighted graph (Q5964975) (← links)
