Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980 - Couverture souple
Autres éditions populaires du même titre
Résultats de recherche pour Graphtheoretic Concepts in Computer Science: Proceedings...
Image d'archives
Graphtheoretic Concepts in Computer Science : Proceedings of the International Workshop WG 80 Bad Honnef, June 1980
Edité par
Springer Berlin / Heidelberg, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Ancien ou d'occasion
Couverture souple
Vendeur : Better World Books Ltd, Dunfermline, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 50342362-20
Acheter D'occasion
EUR 25,27
EUR 9,17 shipping
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graphtheoretic concepts in computer science : proceedings of the Internat. Workshop WG 80, Bad Honnef, June 15 - 18, 1980 / ed. by Hartmut Noltemeier / Lecture notes in computer science ; Vol. 100
Edité par
Berlin ; Heidelberg ; New York : Springer, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Ancien ou d'occasion
Softcover
Vendeur : Roland Antiquariat UG haftungsbeschränkt, Weinheim, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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. N° de réf. du vendeur 219383
Acheter D'occasion
EUR 22,90
EUR 14,95 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Graphtheoretic Concepts in Computer Science. Proceedings of the International Workshop WG 80, Bad Honnef, June 1980
Edité par
Springer-Verlag, Berlin, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Ancien ou d'occasion
Softcover
Edition originale
Vendeur : HJP VERSANDBUCHHANDLUNG, WEDEL, SH, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Softcover. Etat : Good. 1st Edition. 403 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 100]. Back somewhat rubbed - else good. Buch. N° de réf. du vendeur 012980-100
Acheter D'occasion
EUR 22,75
EUR 29,50 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980 (Lecture Notes in Computer Science, 100)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020158922
Acheter neuf
EUR 52,39
EUR 3,38 shipping
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980 (Lecture Notes in Computer Science, 100)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540102915_new
Acheter neuf
EUR 58,18
EUR 13,72 shipping
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
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)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783540102915
Acheter neuf
EUR 56,48
EUR 17,75 shipping
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Graphtheoretic Concepts in Computer Science
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 1981, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540102915
Acheter neuf
EUR 53,49
EUR 23 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Graphtheoretic Concepts in Computer Science
Edité par
Springer Berlin Heidelberg, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 4880893
Acheter neuf
EUR 48,37
EUR 48,99 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Graphtheoretic Concepts in Computer Science
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 1981, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540102915
Acheter neuf
EUR 53,49
EUR 60 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graphtheoretic Concepts in Computer Science : Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980
Edité par
Springer Berlin Heidelberg, 1981
ISBN 10 : 3540102914
ISBN 13 : 9783540102915
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540102915
Acheter neuf
EUR 53,49
EUR 63,17 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)