Graph-Theoretic Concepts in Computer Science: 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$104.64
(Save 4%)
Used and New from Other Sellers
Used and New from Other Sellers
from $25.00
Usually ships in 1-2 business days
(Save 77%)
Other sellers (Paperback)
  • All (9) from $25.00   
  • New (5) from $69.78   
  • Used (4) from $25.00   

More About This Textbook

Overview

This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994.
The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.
Read More Show Less

Product Details

  • ISBN-13: 9783540590712
  • Publisher: Springer-Verlag New York, LLC
  • Publication date: 4/26/1995
  • Series: Lecture Notes in Computer Science Series , #903
  • Edition description: 1995
  • Edition number: 1
  • Pages: 436
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.89 (d)

Table of Contents

Domino Treewidth 1
A Lower Bound for Treewidth and Its Consequences 14
Tree-width and Path-width of Comparability Graphs of Interval Orders 26
A Declarative Approach to Graph Based Modeling 38
Multilevel Graph Grammars 51
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings 65
On Domination Elimination Orderings and Domination Graphs 81
Complexity of Graph Covering Problems 93
Dominoes 106
GLB-Closures in Directed Acyclic Graphs and Their Applications 121
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity 130
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs 140
Specification of Graph Translators with Triple Graph Grammars 151
Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System 164
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages 180
Time-Optimal Tree Computations on Sparse Meshes 193
Prefix Graphs and Their Applications 206
The Complexity of Broadcasting in Planar and Decomposable Graphs 219
The Maximal f-Dependent Set Problem for Planar Graphs is in NC 232
On-Line Convex Planarity Testing 242
Book Embeddings and Crossing Numbers 256
Measuring the Distance to Series-Parallelity by Path Expressions 269
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues 282
Rankings of Graphs 292
Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time 305
Efficient Algorithms for a Mixed k-partition Problem of Graphs without Specifying Bases 319
Fugitive-Search Games on Graphs and Related Parameters 331
New Approximation Results on Graph Matching and Related Problems 343
New Lower Bounds and Hierarchy Results for Restricted Branching Programs 359
On-line Algorithms for Satisfiability Problems with Uncertainty 371
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments 387
Directed Path Graph Isomorphism 395
List of Participants 407
List of Authors 411
The 20 WG-Volumes 413
Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
Your Name: Create a Pen Name or

Barnes & Noble.com 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 & Noble.com 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 & Noble.com 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 BN.com 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

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com 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 BN.com. 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)