Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
ComputingReviews.com
  Parameterized complexity of connected even/odd subgraph problems
Fomin F., Golovach P. Journal of Computer and System Sciences80(1):157-179,2014.Type:Article
 
  Published By: Academic Press, Inc.  
 
  Use your personal or institutional subscription to read the
fulltext of the article.
 
       
 
  You can purchase an article without having a subscription.
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy