Pages that link to "Item:Q679451"

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

Displaying 50 items.

• An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• The density maximization problem in graphs (Q386420) (← links)
• New results for the longest haplotype reconstruction problem (Q423956) (← links)
• On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
• Scheduling for single agile satellite, redundant targets problem using complex networks theory (Q509214) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
• Finding monotone paths in edge-ordered graphs (Q602679) (← links)
• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• Approximating the longest paths in grid graphs (Q719276) (← links)
• A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
• Algorithms for long paths in graphs (Q884457) (← links)
• Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
• Finding large cycles in Hamiltonian graphs (Q972323) (← links)
• Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
• On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
• Drawing graphs in two layers (Q1331939) (← links)
• The lazy bureaucrat scheduling problem (Q1398377) (← links)
• An approximation algorithm for computing longest paths. (Q1812006) (← links)
• Spanning spiders and light-splitting switches (Q1877652) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• The maximum binary tree problem (Q2041978) (← links)
• Cycles and new bounds for the chromatic number (Q2111913) (← links)
• Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
• Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
• On finding spanning trees with few leaves (Q2380066) (← links)
• On approximating maximum covering cycles in undirected graphs (Q2414126) (← links)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• On lazy bureaucrat scheduling with common deadlines (Q2427440) (← links)
• On approximating the \(d\)-girth of a graph (Q2444552) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• The maximum resource bin packing problem (Q2508970) (← links)
• Networks of polynomial pieces with application to the analysis of point clouds and images (Q2654450) (← links)
• QUBO formulations of the longest path problem (Q2658047) (← links)
• Path-Based Mathematical Morphology on Tensor Fields (Q2806291) (← links)
• An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
• The distribution of first hitting times of randomwalks on Erdős–Rényi networks (Q2979696) (← links)
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
• On Approximating the d-Girth of a Graph (Q3075539) (← links)
• The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
• 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)
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
• On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
• Minimal functional routes in directed graphs with dependent edges (Q4924061) (← links)
• On the Power of Planned Infections in Networks (Q4985791) (← links)
• Well-mixing vertices and almost expanders (Q5039232) (← links)