Parameterizing path partitions

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The disjoint paths problem in quadratic time
A linear time algorithm for the induced disjoint paths problem in planar graphs
Improved upper bounds for vertex cover
A game of cops and robbers
Isometric-path numbers of block graphs
Induced-path partition on graphs with special blocks
On mapping processes to processors in distributed systems
Variations on the Gallai-Milgram theorem
The directed subgraph homeomorphism problem
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
A linear algorithm for the Hamiltonian completion number of a tree
Relating path coverings to vertex labellings with a condition at distance two
On the $k$-path partition of graphs.
Splitting a graph into disjoint induced paths or cycles.
Algorithmic meta-theorems for restrictions of treewidth
Path partition for graphs with special blocks
Directed tree-width
Graph minors. XIII: The disjoint paths problem
Path covering problems and testing of printed circuits
HAMILTONian circuits in chordal bipartite graphs
A new planarity test
On the isometric path partition problem
Induced disjoint paths in AT-free graphs
Few induced disjoint paths for $H$-free graphs
Parameterized complexity of $(A,\ell)$-path packing
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
The path partition problem and related problems in bipartite graphs
The isometric path number of a graph
Graph Theory
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
Path Partitions in Directed Graphs
Planar 3DM is NP-complete
The Planar Hamiltonian Circuit Problem 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
Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
The $L(2,1)$-Labeling Problem on Graphs
The Directed Disjoint Shortest Paths Problem
Planar Graphs Have Bounded Queue-Number
Disjoint Paths in Decomposable Digraphs
Parameterized and Exact Computation
Parameterized Algorithms
On the complexity of finding internally vertex-disjoint long directed paths
Parameterizing path partitions
On finding the best and worst orientations for the metric dimension
Using a Geometric Lens to Find $\boldsymbol{k}$-Disjoint Shortest Paths
A local search algorithm for the $k$-path partition problem
Approximating the directed path partition problem
On graphs coverable by ${k}$ shortest paths
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
Complexity and algorithms for isometric path cover on chordal graphs and beyond
Path partitions of phylogenetic networks

This page was built for publication: Parameterizing path partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6664058)