An upper bound for the radius of a 3-connected graph.
Jochen HarantPublished in: Discret. Math. (1993)
Keyphrases
- upper bound
- lower bound
- connected components
- neighborhood graph
- worst case
- random walk
- weighted graph
- graph structure
- graph model
- directed graph
- branch and bound algorithm
- constant factor
- graph based algorithm
- graph mining
- graph construction
- graph representation
- computational complexity
- spanning tree
- bipartite graph
- structured data
- data sets
- graph theory
- lower and upper bounds
- graph theoretic
- binary images
- stable set
- error probability