The perfectly matchable subgraph polytope of an arbitrary graph.
Egon BalasWilliam R. PulleyblankPublished in: Comb. (1989)
Keyphrases
- stable set
- maximum matching
- graph mining
- directed graph
- graph databases
- graph properties
- graph data
- graph classification
- subgraph isomorphism
- dense subgraphs
- labeled graphs
- maximum weight
- graph structure
- frequent subgraph mining
- structured data
- graph search
- graph theoretic
- graph theory
- hamiltonian cycle
- graph representation
- frequent subgraphs
- subgraph matching
- query graph
- random walk
- graph partitioning
- spanning tree
- maximum clique
- graph model
- subgraph mining
- pattern mining
- connected subgraphs
- graph kernels
- bipartite graph
- graph matching
- relational data
- convex hull
- bayesian networks