Partition the vertices of a graph into induced matchings.
Jinjiang YuanQin WangPublished in: Discret. Math. (2003)
Keyphrases
- vertex set
- maximum cardinality
- weighted graph
- bipartite graph
- minimum weight
- undirected graph
- partitioning algorithm
- graph structure
- hamiltonian cycle
- maximum matching
- adjacency matrix
- labeled graphs
- average degree
- planar graphs
- random graphs
- edge weights
- directed edges
- normalized cut
- attributed graphs
- random walk
- graph model
- query graph
- graph representation
- graph theory
- connected graphs
- graph clustering
- min cut
- data sets
- graph partitioning
- directed graph
- graph search
- graph theoretic
- graph mining
- link analysis
- graph matching
- neural network