Zustand: 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 . Bestandsnummer des Verk�ufers 4881063

Verk�ufer kontaktieren

Neu kaufen

EUR 48,37

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Graph Theory and Algorithms

T. Nishizeki

Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1981, 1981

ISBN 10: 3540107045 ISBN 13: 9783540107040

Neu Taschenbuch

Print-on-Demand

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540107040

Verk�ufer kontaktieren

Neu kaufen

EUR 53,49

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

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

T. Nishizeki

Verlag: Springer Berlin Heidelberg, 1981

ISBN 10: 3540107045 ISBN 13: 9783540107040

Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540107040

Verk�ufer kontaktieren

Neu kaufen

EUR 53,49

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Graph Theory and Algorithms

T. Nishizeki

Verlag: Springer Berlin Heidelberg Mai 1981, 1981

ISBN 10: 3540107045 ISBN 13: 9783540107040

Neu Taschenbuch

Print-on-Demand

Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540107040

Verk�ufer kontaktieren