Detachment of Vertices of Graphs Preserving Edge-Connectivity.
Balázs FleinerPublished in: SIAM J. Discret. Math. (2004)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- graph connectivity
- connected components
- strongly connected
- vertex set
- directed graph
- adjacency matrix
- labeled graphs
- shortest path
- random graphs
- spanning tree
- graph model
- densely connected
- graph partitioning
- minimum weight
- graph structure
- graph mining
- attributed graphs
- graph clustering
- maximal cliques
- minimum spanning tree
- edge detection
- graph databases
- edge information
- directed acyclic graph
- directed edges
- data objects
- graph matching
- approximation algorithms
- subgraph isomorphism
- bipartite graph
- minimum cost
- topological information
- edge detector
- binary images
- query graph
- hamiltonian cycle
- average degree
- scale space
- wireless sensor networks
- connected subgraphs
- graph theoretic