A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs

• Autor(a) principal: Awal, Tanveer
• Data de Publicação: 2010
• Outros Autores: Rahman, MD. Saidur
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: INFOCOMP: Jornal de Ciência da Computação
• Texto Completo: https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/301
• topic: Algorithm; Nonseparating ear decomposition; Planar graph; Resource trip artitioning; Resource bipartitioning; st-numbering; Triconnected graph

Given a connected graph G = (V,E), a set Vr ⊆ V of r special vertices, three distinct base vertices u1, u2, u3 ∈ V and three natural numbers r1, r2, r3 such that r1 + r2 + r3 = r, we wish to find a partition V1, V2, V3 of V such that Vi contains ui and ri vertices from Vr, and Vi induces a connected subgraph of G for each i, 1 ≤ i ≤ 3. We call a vertex in Vr a resource vertex and the problem above of partitioning vertices of G as the resource 3-partitioning problem. In this paper, we give a linear-time algorithm for finding a resource tripartition of a 3-connected planar graph G. Our algortihm is based on a nonseparating ear decomposition of G and st-numbering of G. We also present a linear algorithm tofind a nonseparating ear decomposition of a 3-connected planar graph. This algorithm has bounds on ear-length and number of ears.