Counting maximal near perfect matchings in quasirandom and dense graphs.
Yifan JingAkbar RafieyPublished in: CoRR (2018)
Keyphrases
- maximum cardinality
- independent set
- quasi cliques
- graph matching
- graph theory
- graph theoretic
- graph databases
- structured objects
- series parallel
- graph kernels
- dense optical flow
- labeled graphs
- subgraph isomorphism
- graph structures
- data sets
- small world
- graph representation
- graph mining
- bipartite graph
- graphical models