Login / Signup
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges.
M. Aghabali
Saieed Akbari
Shmuel Friedland
Klas Markström
Zakeieh Tajfirouz
Published in:
Eur. J. Comb. (2015)
Keyphrases
</>
upper bound
data sets
undirected graph
database
optimal solution
directed graph
memory requirements