Pages that link to "Item:Q911770"

The following pages link to Linear algorithm for optimal path cover problem on interval graphs (Q911770):

Displaying 49 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
• 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)
• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← 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 longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Optimal path cover problem on block graphs (Q1960660) (← links)
• The Steiner cycle and path cover problem on interval graphs (Q2075469) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• On the \(k\)-path cover problem for cacti (Q2369003) (← links)
• Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← 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)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← 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)
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
• On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← 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)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
• (Q4691777) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)