Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.

Karthick Thiyagarajan Frédéric Maffray

Published in: COCOON (2016)

Keyphrases

maximum weight
independent set
bipartite graph matching
weighted graph
bipartite graph
minimum weight
bipartite matching
partial order
graph theory
shortest path
association graph
learning algorithm
upper bound
worst case
multi dimensional
low complexity