Graph-Theoretic Concepts in Computer Science: International Workshop WG '87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$80.09
Used and New from Other Sellers
Used and New from Other Sellers
from $20.41
Usually ships in 1-2 business days
(Save 79%)
Other sellers (Paperback)
  • All (6) from $20.41   
  • New (3) from $76.59   
  • Used (3) from $20.41   

More About This Textbook

Overview

This book reflects the scientific program of the annual workshop on Graph-theoretic Concepts in Computer Science in 1987. The purpose of this conference is to be the "missing link" between theory and application of graphs in as many branches of computer science as a conference scheduled for three days without parallel sessions can permit. So the organizers of WG '87 addressed a selected group of people with a strong interest in theory and practice. The proceedings include latest results on "classical" graph-theoretic problems (including formal language theory applied to graphs) and how to apply those results to practical problems, e.g. data bases, layout of graph operating systems, software engineering, chemistry, and modelling with graphs.

Read More Show Less

Product Details

  • ISBN-13: 9783540194224
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 7/12/1988
  • Series: Lecture Notes in Computer Science Series , #314
  • Edition description: 1988
  • Edition number: 1
  • Pages: 256
  • Product dimensions: 0.55 (w) x 6.14 (h) x 9.21 (d)

Table of Contents

Distributed parallelism of graph transformations.- A PrT-net representation of graph grammars.- Pretty patterns produced by hyperedge replacement.- Graph languages defined by systems of forbidden structures: A survey.- A sweepcircle algorithm for Voronoi diagrams.- Competitive location in the L1 and Linf metrics.- Priority search trees in secondary memory (extended abstract).- On the analysis of grid structures for spatial objects of non-zero size.- Maintenance of transitive closures and transitive reductions of graphs.- Upward drawings of acyclic digraphs.- Approximate counting, uniform generation and rapidly mixing markov chains extended abstract.- On chaotic behaviour of some np-complete problems.- External labeling and algorithms for hierarchic networks.- Designing gamma-acyclic database schemes using decomposition and augmentation techniques.- Graph-theoretical tools and their use in a practical distributed operating system design case.- Development of several reachability algorithms for directed graphs.- On integration mechanisms within a graph-based software development environment.- Restructuring aspect graphs into aspect- and cell-equivalence classes for use in computer vision.- Automatic crystal chemical classification of silicates using direction-labeled graphs.

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:

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)