Login / Signup
An infinite family of graphs with a facile count of perfect matchings.
Vladimir R. Rosenfeld
Douglas J. Klein
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
maximum cardinality
graph matching
special case
subgraph isomorphism
graph theoretic
graph theory
graph representation
graph mining
structured objects
series parallel
machine learning
graph model
graph partitioning
real time
weighted graph
directed graph
neural network
graph isomorphism
databases