Exact algorithms for the vertex separator problem in graphs
Article first published online: 17 MAR 2011
Copyright © 2011 Wiley Periodicals, Inc.
Special Issue: Seventh Cologne-Twente Workshop
Volume 57, Issue 3, pages 212–230, May 2011
How to Cite
de Souza, C. C. and Cavalcante, V. F. (2011), Exact algorithms for the vertex separator problem in graphs. Networks, 57: 212–230. doi: 10.1002/net.20420
- Issue published online: 22 APR 2011
- Article first published online: 17 MAR 2011
- Manuscript Accepted: JUN 2010
- Manuscript Received: OCT 2008
- CAPES (Brazilian Ministry of Education)
- CNPQ (National Council for Scientific and Technological Development from the Brazilian Ministry of Education). Grant Numbers: 301732/2007-8, 472504/2007-0, 473726/2007-6
Options for accessing this content:
- If you have access to this content through a society membership, please first log in to your society website.
- If you would like institutional access to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article 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!