Packing cycles in undirected graphs
From MaRDI portal
Publication:4458879
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cited in
(34)- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Minimum weakly fundamental cycle bases are hard to find
- Maximum cycle packing using SPR-trees
- Maximum cycle packing in Eulerian graphs using local traces
- Half-integral packing of odd cycles through prescribed vertices
- Approximation algorithms for grooming in optical network design
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Approximability of packing disjoint cycles
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Approximation algorithms and hardness results for cycle packing problems
- Packing arc-disjoint cycles in tournaments
- A note on disjoint cycles
- Packing cycles through prescribed vertices
- Disjoint cycles intersecting a set of vertices
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs
- Disjoint Cycles: Integrality Gap, Hardness, and Approximation
- scientific article; zbMATH DE number 1875440 (Why is no real title available?)
- Packing Arc-Disjoint Cycles in Tournaments
- Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs
- Packing cycles in graphs. II
- Packing cycles through prescribed vertices under modularity constraints
- Approximation algorithms for cycle packing problems
- Packing edge-disjoint cycles in graphs and the cyclomatic number
- Packing disjoint cycles over vertex cuts
- Deriving compact extended formulations via LP-based separation techniques
- Finding Local Genome Rearrangements
- Deriving compact extended formulations via LP-based separation techniques
- Packing directed cycles efficiently
- Packing Euler graphs with traces
- CTL Model-Checking with Graded Quantifiers
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Approximability of Packing Disjoint Cycles
- Induced packing of odd cycles in planar graphs
This page was built for publication: Packing cycles in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458879)
