On the minimum local-vertex-connectivity augmentation in graphs.
Hiroshi NagamochiToshimasa IshiiPublished in: Discret. Appl. Math. (2003)
Keyphrases
- directed graph
- undirected graph
- spanning tree
- labeled graphs
- strongly connected
- attributed graphs
- hamiltonian cycle
- edge weights
- topological information
- minimum cost
- minimum weight
- graph matching
- graph mining
- graph representation
- connected dominating set
- triangle mesh
- connected subgraphs
- maximum cardinality
- connected components
- graph theory
- betweenness centrality
- graph clustering
- vertex set
- graph structure
- graph theoretic
- structured objects
- minimum length
- random graphs
- graph databases
- graph partitioning
- weighted graph
- directed acyclic graph
- adjacency matrix
- topological properties
- social network analysis
- random walk
- average degree
- dominating set
- lower bound
- similarity measure
- neural network