Theoretical Computer Science and General Issues

Graph-Theoretic Concepts in Computer Science

32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers

Editors: Fomin, Fedor V. (Ed.)

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-48382-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-48381-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The workshop was organized by the Algorithms Research Group at the Department of Informatics, University of Bergen, and it took place from June 22 to June 24. The 78 participants of WG 2006 came from the universities and research institutes of 17 di?erent countries. The WG 2006 workshop continues the series of 31 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands, twice in Austria as well as oncein France,in Italy, in Slovakia,in Switz- land and in the Czech Republic, and has now been held for the ?rst time in Norway. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer s- ence, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks showed how recent researchresults from algorithmic graph theory can be used in computer science and which graph-theoreticquestions arisefrom new developments in computer science. There were two fascinating invited lectures by Hans Bodlaender (Utrecht, The Netherlands) and Tandy Warnow (Austin, USA).

Table of contents (31 chapters)

  • Treewidth: Characterizations, Applications, and Computations

    Bodlaender, Hans L.

    Pages 1-14

  • Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy

    Fiala, Jiří (et al.)

    Pages 15-26

  • Generalised Dualities and Finite Maximal Antichains

    Foniok, Jan (et al.)

    Pages 27-36

  • Chordal Deletion Is Fixed-Parameter Tractable

    Marx, Dániel

    Pages 37-48

  • A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators

    Knauer, Christian (et al.)

    Pages 49-57

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-48382-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-48381-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Graph-Theoretic Concepts in Computer Science
Book Subtitle
32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
Editors
  • Fedor V. Fomin
Series Title
Theoretical Computer Science and General Issues
Series Volume
4271
Copyright
2006
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-48382-3
DOI
10.1007/11917496
Softcover ISBN
978-3-540-48381-6
Edition Number
1
Number of Pages
XIII, 358
Topics