The most vital nodes with respect to independent set and vertex cover
Authors:
- Cristina BazganCBCristina Bazgan
- Sonia ToubalineSTSonia Toubaline
- Zsolt TuzaZTZsolt Tuza
- 1 October 2011
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (17) , 1933-1946
Abstract
No abstract availableKeywords
Funding Information
- Hungarian Scientific Research Fund, OTKA (81493)
This publication has 17 references indexed in Scilit:
- Matching interdictionDiscrete Applied Mathematics, 2010
- Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a gridDiscrete Mathematics, 2010
- Blockers and transversalsDiscrete Mathematics, 2009
- Approximation of satisfactory bisection problemsJournal of Computer and System Sciences, 2008
- A simple linear time algorithm for cograph recognitionDiscrete Applied Mathematics, 2005
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- k-NLC graphs and polynomial algorithmsDiscrete Applied Mathematics, 1994
- The hardness of approximation: Gap locationcomputational complexity, 1994
- Deterministic network interdictionMathematical and Computer Modelling, 1993