Graph Theory and Algorithms

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

By: N. Saito (Editor), T. Nishizeki (Editor)

Write A Review

Paperback | 1 May 1981

At a Glance

Paperback
228 Pages

Dimensions(cm)
23.39 x 15.6 x 1.22

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.