Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees.
Wangsen FengWanling QuHanpin WangPublished in: FCS (2007)
Keyphrases
- lower bound
- upper bound
- maximum cardinality
- lower and upper bounds
- objective function
- worst case
- upper and lower bounds
- branch and bound algorithm
- np hard
- branch and bound
- bounded treewidth
- bipartite graph
- graph theory
- graph mining
- spanning tree
- graph partitioning
- graph representation
- vc dimension
- graph matching
- graph theoretic
- max sat
- quadratic assignment problem
- lower bounding
- bounded degree