Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Nonseparating planar chains in 4-connected graphs
Author: Curran, S
Orlando, L
Yu, XX
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.
Subject: connectivity
planar chain
Country: EUA
Editor: Siam Publications
Rights: aberto
Identifier DOI: 10.1137/S0895480103434580
Date Issue: 2005
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000233579200011.pdf286.05 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.