16. The Complexity of the Exact Weighted Independent Set Problem
- Vangelis Th. Paschos
Published Online: 3 FEB 2010
Copyright © 2008 ISTE Ltd.
Combinatorial Optimization and Theoretical Computer Science
How to Cite
Milanič, M. and Monnot, J. (2008) The Complexity of the Exact Weighted Independent Set Problem, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch16
- Published Online: 3 FEB 2010
- Published Print: 1 JAN 2008
Print ISBN: 9781848210219
Online ISBN: 9780470611098
Options for accessing this content:
- If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Chapter for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!