Skip to main content
SpringerLink
Log in

Intractability in Graph Drawing and Geometry: FPT Approaches

  • Conference paper
Combinatorial Algorithms (IWOCA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5874))

Included in the following conference series:

  • 715 Accesses

Abstract

The fixed parameter tractability (FPT) approach pioneered by Downey and Fellows provides an algorithm design philosophy for solving special cases of intractable problems. Here we review several examples from geometry and graph drawing, in particular layered graph drawing, that illustrate fixed parameter tractability techniques.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2), 134–151 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

  3. Bose, P., Everett, H., Fekete, S., Houle, M.E., Lubiw, A., Meijer, H., Romanik, K., Rote, G., Shermer, T., Whitesides, S., Zelle, C.: A visibility representation for graphs in three dimensions. J. Graph Algorithms Appl. 2(2) (1998)

    Google Scholar 

  4. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  5. Dujmović, V., Fellows, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica 52(2), 167–176 (2008)

    Article  MathSciNet  Google Scholar 

  6. Dujmović, V., Fellows, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: A fixed parameter approach to 2-layer planarization. Algorithmica 45(2), 159–182 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dujmović, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica 40(1), 15–31 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoret. Comput. Sci. 131(2), 361–374 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fernau, H.: Parameterized Algorithmics: a Graph Theoretic Approach. Habilitationsschrift, U. Tübingen (2005)

    Google Scholar 

  10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    Google Scholar 

  11. Giannopoulos, P., Knauer, C., Whitesides, S.: Parameterized complexity of geometric problems. Comput. J. 51(3), 372–384 (2008)

    Article  Google Scholar 

  12. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

  13. Suderman, M., Whitesides, S.: Experiments with the fixed-parameter approach for two-layer planarization. J. Graph Algorithms Appl. 9(1), 149–163 (2005)

    MATH  MathSciNet  Google Scholar 

  14. Štola, J.: Unimaximal sequences of pairs in rectangle visibility drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 61–66. Springer, Heidelberg (2009)

    Google Scholar 

  15. Štola, J.: 3D visibility representations of complete graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 226–237. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Victoria, Victoria, BC, Canada

    Sue Whitesides

Authors
  1. Sue Whitesides
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, NSW 2308, Callaghan, Australia

    Mirka Miller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Whitesides, S. (2009). Intractability in Graph Drawing and Geometry: FPT Approaches. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10217-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10216-5

  • Online ISBN: 978-3-642-10217-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation