Sign in
An algorithm for the maximum weight independent set problem on outerstring graphs.
J. Mark Keil
Joseph S. B. Mitchell
Dinabandhu Pradhan
Martin Vatshelle
Published in:
Comput. Geom. (2017)
Keyphrases
</>
maximum weight
independent set
bipartite graph
weighted graph
learning algorithm
bipartite matching
minimum weight
np hard
dynamic programming
segmentation algorithm
maximum independent set
undirected graph
graph structure
computational complexity
optimal solution
partial order
worst case
objective function