Graph Theory and Algorithms [electronic resource] : 17th Symposium of Research Institute of Electrical Communication, Tohoku University Sendai, Japan, October 24–25, 1980 Proceedings / edited by N. Saito, T. Nishizeki.

Contributor(s): Saito, N [editor.] | Nishizeki, T [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 108Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1981Description: VIII, 220 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540386612Subject(s): Computer science | Computer software | Computer Science | Algorithm Analysis and Problem ComplexityAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4520

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha