Items related to 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. ... (Lecture Notes in Computer Science, 108) - Softcover

 
9783540107040: 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)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Buy Used

Condition: Good
216 p; many Ill. [LECTURE NOTES...
View this item

US$ 34.30 shipping from Germany to U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

9783642142802: Graph Theory

Featured Edition

ISBN 10:  364214280X ISBN 13:  9783642142802
Publisher: Springer
Softcover

Search results for Graph Theory and Algorithms: 17th Symposium of Research...

Stock Image

SAITO, N. / NISHIZEKI, T. (ed)
Published by Springer-Verlag, Berlin, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
Used Softcover First Edition

Seller: HJP VERSANDBUCHHANDLUNG, WEDEL, SH, Germany

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Softcover. Condition: Good. 1st Edition. 216 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 108]. Buch. Seller Inventory # 012980-108

Contact seller

Buy Used

US$ 26.95
Convert currency
Shipping: US$ 34.30
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Published by Springer, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar3113020159086

Contact seller

Buy New

US$ 59.16
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Published by Springer, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Softcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9783540107040_new

Contact seller

Buy New

US$ 70.23
Convert currency
Shipping: US$ 16.07
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Published by Springer, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. pp. 228. Seller Inventory # 263102267

Contact seller

Buy New

US$ 87.04
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Saito, N.
Published by Springer 1981-05, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New PF

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

PF. Condition: New. Seller Inventory # 6666-IUK-9783540107040

Contact seller

Buy New

US$ 76.40
Convert currency
Shipping: US$ 20.78
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 10 available

Add to basket

Seller Image

T. Nishizeki
Published by Springer Berlin Heidelberg, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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. Seller Inventory # 9783540107040

Contact seller

Buy New

US$ 64.05
Convert currency
Shipping: US$ 34.60
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Published by Springer, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Softcover
Print on Demand

Seller: Majestic Books, Hounslow, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: 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. Seller Inventory # 5827044

Contact seller

Buy New

US$ 90.01
Convert currency
Shipping: US$ 8.72
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Unbekannt
Published by Springer Berlin Heidelberg, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
Used Softcover

Seller: Buchpark, Trebbin, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Gut. Zustand: Gut | Seiten: 228 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 342335/203

Contact seller

Buy Used

US$ 50.51
Convert currency
Shipping: US$ 52.32
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

T. Nishizeki
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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. Seller Inventory # 9783540107040

Contact seller

Buy New

US$ 76.87
Convert currency
Shipping: US$ 26.74
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Nishizeki T. Saito N.
Published by Springer, 1981
ISBN 10: 3540107045 ISBN 13: 9783540107040
New Softcover
Print on Demand

Seller: Biblios, Frankfurt am main, HESSE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. PRINT ON DEMAND pp. 228. Seller Inventory # 183102257

Contact seller

Buy New

US$ 98.33
Convert currency
Shipping: US$ 11.57
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

There are 3 more copies of this book

View all search results for this book