Articles liés à Graph Theory and Algorithms: 17th Symposium of Research...
Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings - Couverture souple
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 3540107045
- ISBN 13 9783540107040
- ReliureBroché
- Langueanglais
- Nombre de pages228
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Graph Theory and Algorithms: 17th Symposium of Research...
Image d'archives
Graph Theory and Algorithms. Sendai, Japan, October 1980. Proceedings
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 5 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
Quantité disponible : 1 disponible(s)
Image d'archives
Graph Theory and Algorithms : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings
Edité par
Springer Berlin Heidelberg, 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 | Seiten: 228 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 342335/203
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graph Theory and Algorithms
Edité par
Springer Berlin Heidelberg, 1981
ISBN 10 : 3540107045
ISBN 13 : 9783540107040
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 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
Quantité disponible : Plus de 20 disponibles
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
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
Quantité disponible : 1 disponible(s)
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)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540107040_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Graph Theory and Algorithms
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1981, 1981
ISBN 10 : 3540107045
ISBN 13 : 9783540107040
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 -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
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graph Theory and Algorithms
Edité par
Springer Berlin Heidelberg Mai 1981, 1981
ISBN 10 : 3540107045
ISBN 13 : 9783540107040
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 -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
Quantité disponible : 2 disponible(s)
Image d'archives
Graph Theory and Algorithms : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540107040
Quantité disponible : 10 disponible(s)
Image d'archives
Graph Theory and Algorithms
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 228. N° de réf. du vendeur 263102267
Quantité disponible : 4 disponible(s)
Image d'archives
Graph Theory and Algorithms
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 228 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5827044
Quantité disponible : 4 disponible(s)