LEADER 02937nam  22004935  450 
001 996465510003316
005 20221102181616.0
010   $a3-540-38661-0
024 7 $a10.1007/3-540-10704-5
035   $a(CKB)1000000000230111
035   $a(SSID)ssj0000323600
035   $a(PQKBManifestationID)11237076
035   $a(PQKBTitleCode)TC0000323600
035   $a(PQKBWorkID)10299476
035   $a(PQKB)10442426
035   $a(DE-He213)978-3-540-38661-2
035   $a(PPN)155228552
035   $a(EXLCZ)991000000000230111
100   $a20121227d1981      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aGraph Theory and Algorithms$b[electronic resource] $e17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings /$fedited by N. Saito, T. Nishizeki
205   $a1st ed. 1981.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1981.
215   $a1 online resource (VIII, 220 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v108
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-10704-5 
327   $aDividing 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v108
606   $aAlgorithms
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
615  0$aAlgorithms.
615 14$aAlgorithm Analysis and Problem Complexity.
676   $a005.1
702   $aSaito$b N$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aNishizeki$b T$g(Takao),$f1947-2022,$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465510003316
996   $aGraph Theory and Algorithms$92830931
997   $aUNISA