Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph.
Roland GrappeAttila BernáthZoltán SzigetiPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- vertex set
- weighted graph
- strongly connected
- undirected graph
- connected components
- hypergraph model
- adjacency matrix
- disjoint paths
- graph connectivity
- directed graph
- graph matching
- edge detection
- graph representation
- topological information
- edge weights
- pairwise
- random walk
- bipartite graph
- higher order
- graph mining
- edge information
- binary images
- graph data
- graph model
- graph structure
- graph theory
- tree width
- directed acyclic graph
- minimum spanning tree
- graph partitioning
- social networks
- approximation algorithms
- shortest path
- np hard
- clustering algorithm