Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Nonseparating planar chains in 4-connected graphs|
|Abstract:||In this paper, we describe an O(| V (G)|
E(G)|) algorithm for finding a nonseparating planar chain in a 4-connected graph G, which will be used to decompose an arbitrary 4-connected graph into planar chains. This work was motivated by the study of a multitree approach to reliability in distributed networks, as well as the study of nonseparating induced paths in highly connected graphs.
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.