Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. . (Lecture Notes in Computer Science, 108)

ISBN 10: 3540107045 ISBN 13: 9783540107040

Edit� par Springer, 1981

Neuf(s) Couverture souple

Vendeur Ria Christie Collections, Uxbridge, Royaume-Uni �valuation du vendeur 5 sur 5 �toiles

Vendeur AbeBooks depuis 25 mars 2015

Cet article sp�cifique n'est plus disponible.

Afficher tous les articles du vendeur Cr�er une demande de livres portant sur des articles similaires

Afficher tous les exemplaires de ce livre

A propos de cet article

In. N� de r�f. du vendeur ria9783540107040_new

Signaler cet article

D�tails bibliographiques

Titre : Graph Theory and Algorithms: 17th Symposium ...
�diteur : Springer
Date d'�dition : 1981
Reliure : Couverture souple
Etat : New

Meilleurs r�sultats de recherche sur AbeBooks

Image fournie par le vendeur

Autres images

Graph Theory and Algorithms

N. Saito

Edit� par Springer, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Ancien ou d'occasion Softcover

Vendeur : Bookbot, Prague, R�bublique tch�que

�valuation du vendeur 5 sur 5 �toiles

Softcover. Etat : Fair. Aus Bibliothek aussortiert; Leichte Abnutzungen. Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design. N� de r�f. du vendeur 8e04fbc8-a2b7-4c96-b8ea-1d62c8268538

Contacter le vendeur

Acheter D'occasion

EUR 6,19

EUR 18,99 shipping
Exp�dition depuis R�bublique tch�que vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Graph theory and algorithms 17th symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980 : proceedings ed. Lecture notes in computer science 108; Lecture notes in computer science 1 (1973) - 2999 (2004) 108.

Edit� par Berlin, Springer, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Ancien ou d'occasion Softcover

Vendeur : Antiquariat Bookfarm, L�bnitz, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de biblioth�que avec signature et cachet. BON �tat, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 SAI 9783540107040 Sprache: Englisch Gewicht in Gramm: 550. N� de r�f. du vendeur 2504221

Contacter le vendeur

Acheter D'occasion

EUR 22,49

EUR 16 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Graph Theory and Algorithms. Sendai, Japan, October 1980. Proceedings

SAITO, N. / NISHIZEKI, T. (ed)

Edit� par Springer-Verlag, Berlin, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

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. 216 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 108]. Buch. N� de r�f. du vendeur 012980-108

Contacter le vendeur

Acheter D'occasion

EUR 22,50

EUR 29,50 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Graph Theory and Algorithms : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

Unbekannt

Edit� par Springer, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Ancien ou d'occasion Couverture souple

Vendeur : Buchpark, Trebbin, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : Gut. Zustand: Gut | Sprache: Englisch | Produktart: B�cher | Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design. N� de r�f. du vendeur 342335/203

Contacter le vendeur

Acheter D'occasion

EUR 37,96

EUR 105 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Graph Theory and Algorithms

Saito, N.|Nishizeki, T.

Edit� par Springer Berlin Heidelberg, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Neuf Couverture souple

impression � la demande

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. Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions . N� de r�f. du vendeur 4881063

Contacter le vendeur

Acheter neuf

EUR 48,37

EUR 48,99 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Autres images

Graph Theory and Algorithms | 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

N. Saito (u. a.)

Edit� par Springer, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Neuf Taschenbuch

impression � la demande

Vendeur : preigu, Osnabr�ck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Graph Theory and Algorithms | 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings | N. Saito (u. a.) | Taschenbuch | viii | Englisch | 1981 | Springer | EAN 9783540107040 | 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. N� de r�f. du vendeur 102156915

Contacter le vendeur

Acheter neuf

EUR 50,35

EUR 70 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image d'archives

Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. ... (Lecture Notes in Computer Science, 108)

Edit� par Springer, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Neuf Couverture souple

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur ABLIING23Mar3113020159086

Contacter le vendeur

Acheter neuf

EUR 51,79

EUR 3,39 shipping
Exp�dition nationale�: Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Graph Theory and Algorithms

T. Nishizeki

Edit� par Springer Berlin Heidelberg, Springer Mai 1981, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Neuf Taschenbuch

impression � la demande

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 -Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- 'Dualities' in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design. 228 pp. Englisch. N� de r�f. du vendeur 9783540107040

Contacter le vendeur

Acheter neuf

EUR 53,49

EUR 23 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Graph Theory and Algorithms : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

T. Nishizeki

Edit� par Springer Berlin Heidelberg, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

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 - Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- 'Dualities' in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design. N� de r�f. du vendeur 9783540107040

Contacter le vendeur

Acheter neuf

EUR 53,49

EUR 61,77 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Graph Theory and Algorithms

T. Nishizeki

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1981, 1981

ISBN 10 : 3540107045 ISBN 13 : 9783540107040

Neuf Taschenbuch

impression � la demande

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 -Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- 'Dualities' in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch. N� de r�f. du vendeur 9783540107040

Contacter le vendeur

Acheter neuf

EUR 53,49

EUR 60 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

There are 2 autres exemplaires de ce livre sont disponibles

Afficher tous les r�sultats pour ce livre

Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. . (Lecture Notes in Computer Science, 108)

A propos de cet article

Description :

D�tails bibliographiques

Meilleurs r�sultats de recherche sur AbeBooks

Acheter D'occasion

Acheter D'occasion

Acheter D'occasion

Acheter D'occasion

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

There are 2 autres exemplaires de ce livre sont disponibles