Skip to main content
SpringerLink
Log in

Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 83 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Chen J, Liu Y, Lu S, O’Sullivan B, Razgon I (2008) A fixed-parameter algorithm for the directed feedback vertex set problem. In: STOC, Victoria, pp 177–186

    MATH  Google Scholar 

  2. Chitnis RH, Cygan M, Hajiaghayi MT, Marx D (2012) Directed subset feedback vertex set is fixed-parameter tractable. In: ICALP (1), Warwick, pp 230–241

    Google Scholar 

  3. Chitnis RH, Hajiaghayi M, Marx D (2012) Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. In: SODA, Kyoto, pp 1713–1725

    Google Scholar 

  4. Chitnis RH, Egri L, Marx D (2013) List H-coloring a graph by removing few vertices. In: ESA, Sophia Antipolis, pp 313–324

    MATH  Google Scholar 

  5. Kratsch S, Pilipczuk M, Pilipczuk M, Wahlström M (2012) Fixed-parameter tractability of multicut in directed acyclic graphs. In: ICALP (1), Warwick, pp 581–593

    Google Scholar 

  6. Lokshtanov D, Marx D (2011) Clustering with local restrictions. In: ICALP (1), Zurich, pp 785–797

    Google Scholar 

  7. Lokshtanov D, Ramanujan MS (2012) Parameterized tractability of multiway cut with parity constraints. In: ICALP (1), Warwick, pp 750–761

    Google Scholar 

  8. Marx D (2006) Parameterized graph separation problems. Theor Comput Sci 351(3):394–406

    Article  MathSciNet  MATH  Google Scholar 

  9. Marx D, Razgon I (2011) Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: STOC, San Jose, pp 469–478

    MATH  Google Scholar 

  10. Mehlhorn K (1984) Data structures and algorithms 2: graph algorithms and NP-completeness. Springer, Berlin/New York

    Book  MATH  Google Scholar 

  11. Naor M, Schulman LJ, Srinivasan A (1995) Splitters and near-optimal derandomization. In: FOCS, Milwaukee, pp 182–191

    MATH  Google Scholar 

  12. Reed BA, Smith K, Vetta A (2004) Finding odd cycle transversals. Oper Res Lett 32(4):299–301

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, USA

    Rajesh Chitnis

  2. Department of Computer Science, University of Maryland, College Park, MD, USA

    Mohammad Taghi Hajiaghayi

Authors
  1. Rajesh Chitnis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Taghi Hajiaghayi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rajesh Chitnis .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Chitnis, R., Hajiaghayi, M.T. (2016). Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_762

Download citation

Publish with us

Policies and ethics

Search

Navigation