Computing k-vertex Connectivity on an Interval Graph.
Tzong-Wann KaoShi-Jinn HorngPublished in: ICPP (3) (1994)
Keyphrases
- connected components
- directed graph
- strongly connected
- undirected graph
- hamiltonian cycle
- minimum weight
- weighted graph
- edge weights
- graph structure
- vertex set
- labeled graphs
- graph theory
- graph connectivity
- graph representation
- average degree
- spanning tree
- random walk
- attributed graphs
- maximum cardinality
- homology generators
- topological information
- bipartite graph
- graph grammars
- random graphs
- graph theoretic
- graph mining