Pages that link to "Item:Q4796447"

The following pages link to Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447):

Displaying 10 items.

• On island sequences of labelings with a condition at distance two (Q968105) (← links)
• A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
• Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
• Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
• Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs (Q2446859) (← links)
• (Q4472488) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Parameterizing path partitions (Q6664058) (← links)