Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980: v. 100 (Lecture Notes in Computer Science)

H Noltemeier

ISBN 10: 3540102914 / ISBN 13: 9783540102915

Published by Springer 2008-06-13, 2008

About this Item

Seller Inventory # 6666-IUK-9783540102915

Bibliographic Details

• Title: Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980: v. 100 (Lecture Notes in Computer Science)
• Publisher: Springer 2008-06-13
• Publication Date: 2008
• Language: English
• ISBN 10: 3540102914
• ISBN 13: 9783540102915
• Binding: Paperback
• Condition: New

About this title

Synopsis

The post-office problem and related questions.- Series of graphs generated by rational machines.- On linearizing graphs.- Set-theoretic concepts in programming languages and their implementation.- Graph rewriting and automatic, machine-independent program optimization.- Properties of ordered graph grammars.- The power of a one-dimensional vector of processors.- A new data structure for representing sorted lists.- On the use of some almost sure graph properties.- On a generalization of heaps.- Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs.- Issues in the study of graph embeddings.- Schema formalism to investigate logical data base design.- The use of transitively irreducible kernels of full families of functional dependencies in logical data base design.- Graph algorithms for the synthesis and manipulation of data base schemes.- The analysis of search A survey.- A framework for data structures.- Investigating programs in terms of partial graphs.- An observation concerning the complexity of problems with few solutions and its application to cryptography.- Bounding the bandwidth of NP-complete problems.- The complexity of path problems in graphs and path systems of bounded bandwidth.- A comparison between petri-nets and graph grammars.- A graph grammar representation of nonsequential processes.- Reachability homomorphisms on nets.- A birds eye view to path problems.- The chinese postman problem for mixed graphs.- Alternating cycle covers and paths.- Generating all planar 0-,1-,2-,3-connected graphs.- Optimal (s,t)-cuts.- F-factors, perfect matchings and related concepts.