Finding a Path of Superlogarithmic Length
From MaRDI portal
Recommendations
Cited in
(25)- Approximating the maximum clique minor and some subgraph homeomorphism problems
- On a simple randomized algorithm for finding a 2-factor in sparse graphs
- Formally verified algorithms for upper-bounding state space diameters
- A genetic algorithm for the picture maze generation problem
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- Computing and counting longest paths on circular-arc graphs in polynomial time
- An approximation algorithm for the longest cycle problem in solid grid graphs
- An approximation algorithm for the longest path problem in solid grid graphs
- On computing longest paths in small graph classes
- Finding paths and cycles of superpolylogarithmic length
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- On the approximability of some degree-constrained subgraph problems
- scientific article; zbMATH DE number 2086688 (Why is no real title available?)
- Longest (s, t)-paths in L-shaped grid graphs
- Finding Paths and Cycles of Superpolylogarithmic Length
- Approximating long cycle above Dirac's guarantee
- Approximating the longest paths in grid graphs
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- Algorithms for long paths in graphs
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity
- Finding large cycles in Hamiltonian graphs
- Algorithm for two disjoint long paths in 2-connected graphs
This page was built for publication: Finding a Path of Superlogarithmic Length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429693)
