Pages that link to "Item:Q2457005"
From MaRDI portal
The following pages link to Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005):
Displaying 13 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- On finding the best and worst orientations for the metric dimension (Q6093374) (← links)
