Graphtheoretic Concepts Computer Science (23 results)

Condition: Very Good. 403 pp., Paperback, previous owner's name to the front cover else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Broschiert. Condition: Gut. 355 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 460.

Softcover. 339 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. L08012 3446127488 Sprache: Englisch Gewicht in Gramm: 510.

Softcover. 1989. VII, 457 p. Very good condition. Reading pages are very clean and without marks. Slight traces of storage or use. Otherwise very good exemplar. 9783540507284 Sprache: Englisch Gewicht in Gramm: 1452.

Condition: Very Good. 1981st Edition. Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.

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.

Softcover. 1988. VI, 254 S. : graph. Darst. Good condition. Reading pages are clean and without marks. Slight traces of storage or use. Otherwise good exemplar. 9783540194224 Sprache: Englisch Gewicht in Gramm: 431.

Broschiert. Condition: Gut. 339 Seiten: graph. Darst. Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung altersentsprechend sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 400.

Softcover. Condition: Good. 1st Edition. 403 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 100]. Back somewhat rubbed - else good. Buch.

Condition: New.

Broschiert. Condition: Gut. 364 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Einbandkanten sind bestoßen. Sprache: Deutsch Gewicht in Gramm: 600.

Condition: New. In.

Paperback. Condition: New.

.- Berlín Heidelberg New York. 1981. Springer - Verlag. 4º menor. X- 403 pgs. Rústica editorial . Muy buen estado. . . ISBN 10: 3540102914. Informática.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Softcover Sehr gut erhalten.

Softcover Sehr gut erhalten.

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.

Condition: New. Print on Demand pp. 420 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 o.

Condition: New. PRINT ON DEMAND pp. 420.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 420 pp. Englisch.

Taschenbuch. Condition: Neu. Graphtheoretic Concepts in Computer Science | Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980 | H. Noltemeier | Taschenbuch | xii | Englisch | 1981 | Springer | EAN 9783540102915 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.