The Complexity of the Matching-cut Problem for Various Graph Classes.
Paul S. BonsmaPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- graph matching
- planar graphs
- matching algorithm
- complexity measures
- tractable cases
- graph representation
- maximum matching
- association graph
- attributed relational graph
- equivalence classes
- graph structure
- structured data
- maximum weight
- subgraph isomorphism
- maximum cardinality
- normalized cut
- worst case
- graph model
- weighted graph
- graph theoretic
- graph partitioning
- undirected graph
- directed graph
- image matching
- keypoints
- vertex set
- pattern matching
- random walk
- minimal spanning tree
- np complete
- pairwise