The most vital nodes with respect to independent set and vertex cover.

Cristina Bazgan Sonia Toubaline Zsolt Tuza

Published in: Discret. Appl. Math. (2011)

Keyphrases

vertex cover
independent set
planar graphs
approximation algorithms
minimum cost
partial order
maximum weight
precedence constraints
polynomial time approximation
maximum independent set
learning algorithm
network structure
directed graph
ant colony optimization
link prediction
graph structure