Cantitate/Preț
Produs

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

Editat de H Noltemeier
Notă GoodReads:
en Limba Engleză Carte Paperback – February 1981

Din seria Lecture Notes in Computer Science

Preț: 32361 lei

Preț vechi: 40451 lei
-20%

Puncte Express: 485

Preț estimativ în valută:
6702 8052$ 5942£

Carte tipărită la comandă

Livrare economică 26 octombrie-09 noiembrie
Livrare express 30 septembrie-06 octombrie pentru 22450 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540102915
ISBN-10: 3540102914
Pagini: 420
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția: 1981
Editura: Springer
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării: Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.