Login / Signup
Maximum weight independent set for ℓclaw-free graphs in polynomial time.
Andreas Brandstädt
Raffaele Mosca
Published in:
Discret. Appl. Math. (2018)
Keyphrases
</>
independent set
maximum weight
maximum independent set
bipartite graph
weighted graph
minimum weight
special case
partial order
computational complexity
np hard
worst case
social networks
randomized algorithm