On the connectivity of a random interval graph.
Erhard GodehardtJerzy JaworskiPublished in: Random Struct. Algorithms (1996)
Keyphrases
- connected components
- graph theory
- graph connectivity
- random walk
- strongly connected
- graph representation
- directed graph
- graph structure
- graph based algorithm
- topological information
- structured data
- interval data
- graph search
- graph partitioning
- stable set
- graph construction
- shortest path problem
- data sets
- spanning tree
- graph matching
- pairwise