Pages that link to "Item:Q1401225"

The following pages link to On the \(k\)-path partition of graphs. (Q1401225):

Displaying 18 items.

• Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
• Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
• A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
• A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
• On the complexity of the \(k\)-customer vehicle routing problem (Q1886800) (← links)
• Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
• Path cover problems with length cost (Q2154120) (← links)
• On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) (Q2299995) (← links)
• A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
• On the \(k\)-path cover problem for cacti (Q2369003) (← links)
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← links)
• The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• Path cover problems with length cost (Q6069927) (← links)
• A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
• Approximating the directed path partition problem (Q6204168) (← links)
• Design of controllable leader-follower networks via memetic algorithms (Q6497563) (← links)