Paths, cycles, trees and subgraph problems
Hamiltonian paths and cycles, longest paths and cycles, disjoint paths and path covers, constrained spanning and Steiner trees, minimum equivalent digraph, traveling salesperson and vehicle routing, and (induced) subgraph isomorphism.
- Asymmetric traveling salesperson problem
- Capacitated vehicle routing
- Degree-constrained spanning tree
- Directed Hamiltonian cycle
- Hamiltonian path in directed graphs
- Induced subgraph isomorphism
- Longest cycle
- Longest path
- Maximum common induced subgraph
- Maximum leaf spanning tree
- Minimum equivalent digraph
- Path cover of a digraph
- Steiner tree
- Subgraph isomorphism
- Traveling salesperson problem
- Undirected Hamiltonian cycle
- Undirected Hamiltonian path
- Vertex-disjoint paths in digraphs
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.