Finding all minimum-size separating vertex sets in a graph.
Arkady KanevskyPublished in: Networks (1993)
Keyphrases
- edge disjoint
- maximum clique
- spanning tree
- directed graph
- strongly connected
- total length
- undirected graph
- random walk
- minimum weight
- maximal cliques
- graph theory
- constant factor
- graph theoretic
- graph model
- graph representation
- edge weights
- bipartite graph
- maximum cardinality
- vertex set
- weighted graph
- labeled graphs
- hamiltonian cycle
- graph clustering
- directed acyclic graph
- graph structure
- lower bound
- average degree
- minimum total cost
- connected dominating set
- graph search
- graph mining
- connected components
- structured data
- special case