A genetic algorithm for the picture maze generation problem
From MaRDI portal
Publication:2289933
Recommendations
Cites work
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- A simple polynomial algorithm for the longest path problem on cocomparability graphs
- Algorithms for long paths in graphs
- An approximation algorithm for computing longest paths.
- Approximating the longest paths in grid graphs
- Finding a Longest Path in a Complete Multipartite Digraph
- Finding a Path of Superlogarithmic Length
- Finding Long Paths, Cycles and Circuits
- Finding Paths and Cycles of Superpolylogarithmic Length
- Hamilton Paths in Grid Graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On approximating the longest path in a graph
- On computing a longest path in a tree
- On computing longest paths in small graph classes
- The Longest Path Problem Is Polynomial on Interval Graphs
This page was built for publication: A genetic algorithm for the picture maze generation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289933)