Pages that link to "Item:Q3065608"
From MaRDI portal
The following pages link to ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608):
Displaying 23 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- A genetic algorithm for the picture maze generation problem (Q2289933) (← links)
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs (Q3605503) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
- Reconstruction of Interval Graphs (Q5323055) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)
