Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph.
Satoshi TaokaToshimasa WatanabePublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2019)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- strongly connected
- graph connectivity
- vertex set
- connected components
- directed graph
- disjoint paths
- shortest path
- adjacency matrix
- minimum weight
- graph structure
- graph partitioning
- graph model
- labeled graphs
- random graphs
- planar graphs
- directed acyclic graph
- bipartite graph
- graph representation
- minimum spanning tree
- spanning tree
- binary images
- attributed graphs
- average degree
- densely connected
- connected graphs
- random walk
- edge information
- graph theory
- graph based algorithm
- graph matching
- data objects
- query graph
- hamiltonian cycle
- complex networks