The Forest Wrapping Problem on Outerplanar Graphs

  • Authors:

  • Isabella Lari;Federica Ricca;Andrea Scozzari

  • Affiliations:

  • -;-;-

  • Venue:
  • WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study the Forest Wrapping Problem (FWP) which can be stated as follows: given a connected graph G = (V, E), with |V| = n, let 驴0 be a partition of G into K (not necessarily connected) components, find a connected partition 驴* of G that wraps 驴0 and has maximum number of components.The Forest Wrapping problem is NP-complete on grid graphs while is solvable in O(n log n) time on ladder graphs. We provide a two-phase O(n2) time algorithm for solving FWP on outerplanar graphs.