Pages that link to "Item:Q1178689"

The following pages link to Optimal covering of cacti by vertex-disjoint paths (Q1178689):

Displaying 17 items.

• Fast-mixed searching and related problems on graphs (Q393051) (← links)
• On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
• An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
• Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472) (← links)
• Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
• Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• On the \(k\)-path cover problem for cacti (Q2369003) (← 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)
• Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
• (Q4691777) (← links)
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)