Bounds on the average connectivity of a graph.
Peter DankelmannOrtrud OellermannPublished in: Discret. Appl. Math. (2003)
Keyphrases
- connected components
- graph connectivity
- graph structure
- upper bound
- graph theory
- graph representation
- path length
- error bounds
- spanning tree
- random graphs
- upper and lower bounds
- graph theoretic
- graph model
- directed graph
- data sets
- stable set
- bipartite graph
- standard deviation
- average case
- graph based algorithm
- worst case
- dependency graph
- topological information
- structured data
- lower bound
- strongly connected
- graph search
- weighted graph
- graph partitioning
- minimum cost