Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 98%)
Other sellers (Paperback)
  • All (9) from $1.99   
  • New (6) from $93.65   
  • Used (3) from $1.99   

More About This Textbook


This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004.

The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and exponential algorithms; counting, combinatorics, and optimization; applications in bioinformatics and graph drawing; and graph classes and NP-hard problems.

Read More Show Less

Product Details

  • ISBN-13: 9783540241324
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 2/24/2005
  • Series: Lecture Notes in Computer Science Series, #3353
  • Edition description: 2005
  • Edition number: 1
  • Pages: 404
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.86 (d)

Table of Contents

Invited Papers.- Lexicographic Breadth First Search – A Survey.- Wireless Networking: Graph Theory Unplugged.- Graph Algorithms: Trees.- Constant Time Generation of Trees with Specified Diameter.- Treelike Comparability Graphs: Characterization, Recognition, and Applications.- Elegant Distance Constrained Labelings of Trees.- Collective Tree Spanners and Routing in AT-free Related Graphs.- Graph Algorithms: Recognition and Decomposition.- On the Maximum Cardinality Search Lower Bound for Treewidth.- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs.- Recognizing HHD-free and Welsh-Powell Opposition Graphs.- Bimodular Decomposition of Bipartite Graphs.- Coloring a Graph Using Split Decomposition.- Graph Algorithms: Various Problems.- Decremental Clique Problem.- A Symbolic Approach to the All-Pairs Shortest-Paths Problem.- Minimal de Bruijn Sequence in a Language with Forbidden Substrings.- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic .- Optimization and Approximation Algorithms.- The Computational Complexity of the Minimum Weight Processor Assignment Problem.- A Shastic Location Problem with Applications to Tele-diagnostic.- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.- Tolerance Based Algorithms for the ATSP.- Parameterized Complexity and Exponential Algorithms.- Finding k Disjoint Triangles in an Arbitrary Graph.- Exact (Exponential) Algorithms for the Dominating Set Problem.- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps.- Counting, Combinatorics, and Optimization.- Planar Graphs, via Well-Orderly Maps and Trees.- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs.- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.- Applications (Biology, Graph Drawing).- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs.- Octagonal Drawings of Plane Graphs with Prescribed Face Areas.- Crossing Reduction in Circular Layouts.- Graph Classes and NP Hardness.- Characterization and Recognition of Generalized Clique-Helly Graphs.- Edge-Connectivity Augmentation and Network Matrices.- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.- Core Stability of Minimum Coloring Games.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)