Pages that link to "Item:Q1257337"
From MaRDI portal
The following pages link to Minimum node disjoint path covering for circular-arc graphs (Q1257337):
Displayed 21 items.
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← links)
- Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472) (← 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)
- Optimal path cover problem on block graphs (Q1960660) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← 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)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- (Q4691777) (← links)
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)