How many random edges make a dense graph hamiltonian?
Tom BohmanAlan M. FriezeRyan R. MartinPublished in: Random Struct. Algorithms (2003)
Keyphrases
- directed graph
- weighted graph
- densely connected
- undirected graph
- spanning tree
- edge weights
- directed acyclic graph
- massive graphs
- graph mining
- quasi cliques
- random walk
- spectral embedding
- graph structure
- nodes of a graph
- directed edges
- graph representation
- vertex set
- structured data
- graph theory
- bipartite graph
- image structure
- graph theoretic
- graph construction
- maximum matching
- real world graphs
- multiscale
- lower bound
- constraint satisfaction problems
- shortest path
- strongly connected
- random graphs
- connected components
- graph partitioning
- graph databases
- edge information