Login / Signup
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.
B. S. Panda
Dinabandhu Pradhan
Published in:
Discret. Appl. Math. (2013)
Keyphrases
</>
bipartite graph
dominating set
connected dominating set
facility location problem
maximum matching
link prediction
maximum cardinality
minimum weight
bipartite graph matching
convex hull
maximum weight
pairwise
multi objective
optimization problems