Parameterizing path partitions
From MaRDI portal
Publication:6057329
DOI10.1007/978-3-031-30448-4_14arXiv2212.11653MaRDI QIDQ6057329
K. N. Rajath Rao, Utkarsh Padariya, Kevin Mann, Henning Fernau, Florent Foucaud
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.11653
parameterized complexityneighborhood diversityvertex cover parameterization\textsf{NP}-hardnesspath partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The disjoint paths problem in quadratic time
- On mapping processes to processors in distributed systems
- The directed subgraph homeomorphism problem
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- On the \(k\)-path partition of graphs.
- Splitting a graph into disjoint induced paths or cycles.
- Algorithmic meta-theorems for restrictions of treewidth
- Graph minors. XIII: The disjoint paths problem
- On the isometric path partition problem
- The path partition problem and related problems in bipartite graphs
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
- Parameterized Algorithms for Modular-Width
- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Planar 3DM is NP-complete
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Finding k Disjoint Paths in a Directed Planar Graph
- Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
- Parameterized Algorithms
This page was built for publication: Parameterizing path partitions
