Pages that link to "Item:Q1903198"
From MaRDI portal
The following pages link to An optimal path cover algorithm for cographs (Q1903198):
Displaying 26 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← 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)
- Hamiltonicity in graphs with few \(P_ 4\)'s (Q1805009) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← 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)
- Efficient parallel recognition of cographs (Q2565857) (← 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)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
