Pages that link to "Item:Q679451"

The following pages link to On approximating the longest path in a graph (Q679451):

Displaying 26 items.

• Understanding chicken walks on <i>n</i> × <i>n</i> grid: Hamiltonian paths, discrete dynamics, and rectifiable paths (Q3467125) (← links)
• The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
• Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
• On the length of simplex paths: The assignment case (Q3698637) (← links)
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
• On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
• An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883) (← links)
• Minimal functional routes in directed graphs with dependent edges (Q4924061) (← links)
• (Q4952685) (← links)
• On the Power of Planned Infections in Networks (Q4985791) (← links)
• Well-mixing vertices and almost expanders (Q5039232) (← links)
• On approximating the longest path in a graph (Q5060133) (← links)
• The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks (Q5272490) (← links)
• Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
• Automata, Languages and Programming (Q5466464) (← links)
• The Maximum Binary Tree Problem. (Q5874498) (← links)
• Tropical paths in vertex-colored graphs (Q5918388) (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)
• Social distancing network creation (Q6107894) (← links)
• Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)
• The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)
• Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
• Improved approximation algorithms for the \(k\)-path partition problem (Q6635814) (← links)
• Algorithms for the thief orienteering problem on directed acyclic graphs (Q6652432) (← links)