Pages that link to "Item:Q4962688"
From MaRDI portal
The following pages link to Approximation algorithms and hardness results for cycle packing problems (Q4962688):
Displayed 25 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- A note on disjoint cycles (Q413261) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Disjoint cycles intersecting a set of vertices (Q713977) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Disjoint Even Cycles Packing (Q2851449) (← links)
- Maximum cycle packing using SPR-trees (Q5009941) (← links)
- Cycle decompositions and constructive characterizations (Q5009962) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Packing Euler graphs with traces (Q5176280) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- (Q5743513) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)