ON DISJOINT CYCLES
From MaRDI portal
Publication:4304619
DOI10.1142/S0129054194000049zbMath0803.05030OpenAlexW2091977535MaRDI QIDQ4304619
Publication date: 2 January 1995
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054194000049
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the Complexity of Singly Connected Vertex Deletion, Parameterized Complexity of Fair Feedback Vertex Set Problem, Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs, Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems, Unnamed Item, Backdoors to Satisfaction, What’s Next? Future Directions in Parameterized Complexity, Parameterized Graph Cleaning Problems, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Parameterized complexity of fair feedback vertex set problem, Packing arc-disjoint cycles in tournaments, On interval routing schemes and treewidth, Inapproximability of $H$-Transversal/Packing, Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs, Vertex-disjoint directed and undirected cycles in general digraphs, A parameterized algorithm for subset feedback vertex set in tournaments, A Linear Kernel for Planar Feedback Vertex Set, Arkhipov's theorem, graph minors, and linear system nonlocal games, On Interval Routing Schemes and treewidth, Parameterized complexity of finding connected induced subgraphs, Packing arc-disjoint cycles in oriented graphs, Obtaining a planar graph by vertex deletion, The decycling number of outerplanar graphs, Contracting graphs to paths and trees, An improved parameterized algorithm for the independent feedback vertex set problem, On feedback vertex set: new measure and new structures, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Improved algorithms for feedback vertex set problems, Parameterized graph cleaning problems, A cubic kernel for feedback vertex set and loop cutset, Satisfactory graph partition, variants, and generalizations, Faster deterministic \textsc{Feedback Vertex Set}, The satisfactory partition problem, A Quartic Kernel for Pathwidth-One Vertex Deletion, An improved FPT algorithm for independent feedback vertex set, Mim-width. II. The feedback vertex set problem, Improved analysis of highest-degree branching for feedback vertex set, The parameterized complexity of cycle packing: indifference is not an issue, Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, A partial k-arboretum of graphs with bounded treewidth, Packing Arc-Disjoint Cycles in Tournaments, Packing Cycles Faster Than Erdos--Posa, Arc-Disjoint Directed and Undirected Cycles in Digraphs, Unnamed Item, On the complexity of singly connected vertex deletion, On group feedback vertex set parameterized by the size of the cutset
