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

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

ISBN 10: 3540107045 / ISBN 13: 9783540107040

Editore: Springer-Verlag, Berlin, 1981

Riguardo questo articolo

216 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 108]. Codice articolo 012980-108

Dati bibliografici

Titolo: Graph Theory and Algorithms. Sendai, Japan, ...

Casa editrice: Springer-Verlag, Berlin

Data di pubblicazione: 1981

Legatura: Softcover

Condizione: Good

Edizione: 1st Edition.

Tipologia articolo: Buch

Descrizione articolo

Contenuti:

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.