Graph Theory and Algorithms

T. Nishizeki

ISBN 10: 3540107045 / ISBN 13: 9783540107040

Published by Springer Berlin Heidelberg Mai 1981, 1981

About this Item

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

Bibliographic Details

• Title: Graph Theory and Algorithms
• Publisher: Springer Berlin Heidelberg Mai 1981
• Publication Date: 1981
• Language: English
• ISBN 10: 3540107045
• ISBN 13: 9783540107040
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings (Lecture Notes in Computer Science)