Hamilton cycles containing randomly selected edges in random regular graphs.
Robert W. RobinsonNicholas C. WormaldPublished in: Random Struct. Algorithms (2001)
Keyphrases
- randomly selected
- directed graph
- random selection
- weighted graph
- undirected graph
- spanning tree
- real world graphs
- graph matching
- graph theory
- massive graphs
- connected components
- graph structure
- directed acyclic graph
- edge weights
- spectral embedding
- graph clustering
- directed edges
- graph representation
- edge information
- edge detector
- uniformly distributed
- graph theoretic
- subgraph isomorphism
- series parallel
- graph partitioning
- graph databases