Format:
Online-Ressource (VI, 216 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540386612
Series Statement:
Lecture notes in computer science 108
Content:
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.
Note:
Literaturangaben
Additional Edition:
ISBN 3540107045
Additional Edition:
ISBN 0387107045
Additional Edition:
ISBN 9783540107040
Additional Edition:
Erscheint auch als Druck-Ausgabe Graph theory and algorithms Berlin [u.a.] : Springer, 1981 ISBN 3540107045
Additional Edition:
ISBN 0387107045
Language:
English
Subjects:
Computer Science
Keywords:
Graphentheorie
;
Konferenzschrift
DOI:
10.1007/3-540-10704-5
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
