Skip to main content
Springer Nature Link
Log in

The Forest Wrapping Problem on Outerplanar Graphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2573))

Included in the following conference series:

  • 768 Accesses

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(n 2) time algorithm for solving FWP on outerplanar graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M.X. Goemans, D.P. Williamson, “A General Approximation Technique for Constrained Forest Problems”, SIAM J. of Computing 24, 296–317 (1995).

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Hansen, B. Jaumard, K. Musitu, “Weight Constrained Maximum Split Clustering”, J. of Classification 7, 217–240 (1990).

    Article  MathSciNet  Google Scholar 

  3. P. Hansen, B. Jaumard, B. Simeone and V. Doring, “Maximum Split Clustering Under Connectivity Constraints”, Les Cahiers du GERARD report G-93-06, (1993).

    Google Scholar 

  4. I. Lari, “Connected Maximum Split Clustering of Ladder Graphs”, Proceedings of Gellschaft fur Klassifikation e. V. 24th Annual Conference-Passau 2000.

    Google Scholar 

  5. J. Valdes, R.E. Tarjan, and E.L. Lawler “The recognition of Series Parallel Digraphs”, SIAM J. on Comp. 11, 298–313 (1982).

    Article  MATH  MathSciNet  Google Scholar 

  6. J.A. Wald, C.J. Colbourn, “Steiner Trees, Partial 2-Trees, and Minimum IFI Networks”, Networks 13, 159–167 (1983).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Statistica, Probabilità e Statistiche Applicate, Università di Roma “La Sapienza”, Italy

    Isabella Lari & Federica Ricca

  2. Dip. Matematica per le Decisioni Economiche, Finanziarie ed Assicurative Università di Roma “La Sapienza”, Italy

    Andrea Scozzari

Authors
  1. Isabella Lari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Federica Ricca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrea Scozzari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Prague, Czech Republic

    Luděk Kučera

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lari, I., Ricca, F., Scozzari, A. (2002). The Forest Wrapping Problem on Outerplanar Graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-36379-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00331-1

  • Online ISBN: 978-3-540-36379-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics