Graphtheoretic Concepts in Computer Science

Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980

AvH Noltemeier

Häftad, Engelska, 1981

Del i serien Lecture Notes in Computer Science

566 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1981-02-01
Mått:155 x 235 x 23 mm
Vikt:633 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:408
Upplaga:1981
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540102915

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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 hypergraphs:A 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 trees: 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.