Pages that link to "Item:Q4458879"
From MaRDI portal
The following pages link to Packing cycles in undirected graphs (Q4458879):
Displayed 27 items.
- A note on disjoint cycles (Q413261) (← 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)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Maximum cycle packing in Eulerian graphs using local traces (Q2259574) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- Maximum cycle packing using SPR-trees (Q5009941) (← links)
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Finding Local Genome Rearrangements (Q5111832) (← links)
- Packing Euler graphs with traces (Q5176280) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- (Q5743513) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs (Q6038707) (← links)