Pages that link to "Item:Q911770"
From MaRDI portal
The following pages link to Linear algorithm for optimal path cover problem on interval graphs (Q911770):
Displayed 25 items.
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472) (← links)
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- The path-partition problem in block graphs (Q1342260) (← links)
- \(k\)-path partitions in trees (Q1377668) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Optimal path cover problem on block graphs (Q1960660) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)