Tighter Approximations for Maximum Induced Matchings in Regular Graphs.

Zvi Gotthilf Moshe Lewenstein

Published in: WAOA (2005)

Keyphrases

maximum cardinality
upper bound
lower bound
graph matching
bipartite graph
median graph
efficient computation
maximum number
np hard
graph theoretic
graph clustering
series parallel
neural network
semi supervised
knn
database
graph theory
weighted graph
optimal solution