The Prism Over the Middle-levels Graph is Hamiltonian.
Peter HorákTomás KaiserMoshe RosenfeldZdenek RyjácekPublished in: Order (2005)
Keyphrases
- graph theory
- random walk
- high levels
- directed graph
- levels of abstraction
- graph structure
- weighted graph
- graph mining
- stable set
- information retrieval
- lower levels
- graph representation
- undirected graph
- connected components
- case study
- graph model
- directed acyclic graph
- bipartite graph
- graph theoretic
- image segmentation
- generation algorithm
- graph construction
- graph coloring
- graph based algorithm
- information systems