---

＜電子ブック＞
Graph Theory and Algorithms : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings / edited by N. Saito, T. Nishizeki
(Lecture Notes in Computer Science. ISSN:16113349 ; 108)

版	1st ed. 1981.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1981
本文言語	英語
大きさ	VIII, 220 p : online resource
著者標目	Saito, N editor Nishizeki, T editor SpringerLink (Online service)
件　名	LCSH:Algorithms FREE:Algorithms
一般注記	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 HTTP:URL=https://doi.org/10.1007/3-540-10704-5

 類似資料