Tight Co-Degree Condition for Perfect Matchings in 4-Graphs.
Andrzej CzygrinowVikram KamatPublished in: Electron. J. Comb. (2012)
Keyphrases
- maximum cardinality
- sufficient conditions
- random graphs
- lower bound
- graph matching
- graph representation
- graph theory
- upper bound
- bipartite graph
- graph theoretic
- graph mining
- real time
- graph model
- decision trees
- graph construction
- degree distribution
- np complete
- database
- pairwise
- weighted graph
- pattern recognition
- website
- graph clustering
- neural network
- graph isomorphism