A note on the computational complexity of graph vertex partition.
Yuanqiu HuangYuming ChuPublished in: Discret. Appl. Math. (2007)
Keyphrases
- vertex set
- computational complexity
- directed graph
- undirected graph
- partitioning algorithm
- minimum weight
- graph theory
- weighted graph
- labeled graphs
- edge weights
- graph structure
- average degree
- computational cost
- graph matching
- graph representation
- maximum cardinality
- attributed graphs
- graph clustering
- special case
- low complexity
- connected components
- graph model
- spanning tree
- bipartite graph
- minimum spanning tree
- approximation algorithms
- np complete
- dependency graph
- hamiltonian cycle
- strongly connected
- worst case
- random walk
- social network analysis
- memory requirements
- adjacency matrix
- graph mining