Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop Wg 80 Bad Honnef, June 15-18, 1980 Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop Wg 80 Bad Honnef, June 15-18, 1980
"synopsis" may belong to another edition of this title.
Seller: HJP VERSANDBUCHHANDLUNG, WEDEL, SH, Germany
Softcover. Condition: Good. 1st Edition. 403 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 100]. Back somewhat rubbed - else good. Buch. Seller Inventory # 012980-100
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5908079-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540102915
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 5908079
Seller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
Softcover. 1981. X, 403 S. : graph. Darst. ; 25 cm Unread book. Very good condition. Minimal traces of storage. 9783540102915 Sprache: Englisch Gewicht in Gramm: 726. Seller Inventory # 219383
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540102915_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783540102915
Quantity: 10 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 5908079-n
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 420 pp. Englisch. Seller Inventory # 9783540102915
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 5908079
Quantity: Over 20 available