Pages that link to "Item:Q5060133"
From MaRDI portal
The following pages link to On approximating the longest path in a graph (Q5060133):
Displaying 16 items.
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- Longest-edge \(n\)-section algorithms: properties and open problems (Q747921) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Bounding the distance among longest paths in a connected graph (Q1699570) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- A genetic algorithm for the picture maze generation problem (Q2289933) (← links)
- An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
- An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883) (← links)
- (Q4952685) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Automata, Languages and Programming (Q5466464) (← links)