Category:LNCS 108

From BibNetWiki

Lecture Notes in Computer Science, Volume 108

Articles in category "LNCS 108"

There are 20 articles in this category.

A A graph-planarization algorithm and its application to random graphs A linear algorithm for five-coloring a planar graph A status on the linear arboricity Algorithms for some intersection graphs An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph C Canonical decompositions of symmetric submodular systems

C cont. Characterization of polyhex graphs as applied to chemistry Combinatoriai problems on series-parallel graphs D Dividing a system into almost unidirectional blocks Dualitiesin graph theory and the related fields viewed from the metatheoretical standpoint G Graph theory and algorithms: 17th symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980: proceedings H Homomorphisms of graphs and their global maps O On central trees of a graph

O cont. On centrality functions of a graph On polynomial time computable problems On the layering problem of multilaycr PWB Wiring P Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing (CONPAR '81) S Some common properties for regularisable graphs, edge-critical graphs and B-graphs T The subgraph homeomorphism problem on reducible flow graphs The two disjoint path problem and wire routing design