Skip to main content
SpringerLink
Log in

A polynomial algorithm for partitioning line-graphs

  • Seminars
  • Conference paper
  • First Online:
Combinatorial Optimization

Part of the book series: Lecture Notes in Mathematics ((LNMCIME,volume 1403))

  • 609 Accesses

Abstract

Two NP-complete unweighted graph partitioning problems are considered: Simple Max Partitioning (SMP) and Uniform Graph Partitioning (UGP). For both problems, polynomial-time algorithms are available for special classes of graphs. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both UGP and SMP in this class.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. C. Arbib: "A polynomial characterization of some graph partitioning problems"-Inf. Proc. Letters (1987/88) pp. 223–230.

    Google Scholar 

  2. L.W. Beineke: "Derived graphs of digraphs" in Beiträge zur graphentheorie, Sachs et al. eds. (Teubner, Leipzig 1978) pp. 17–33.

    Google Scholar 

  3. C. Berge: Graphes et Hypergraphes-(Dunod, Paris 1970).

    Google Scholar 

  4. M.W. Bern, E.L. Lawler, A.L. Wong: "Why certain subgraphs computations require only linear time"-Proc. of the 26th Ann. IEEE Symp. on Found. Comp. Sci.

    Google Scholar 

  5. M.R. Garey, D.S. Johnson: Computers and Intractability — A Guide through NP-completeness (W.H. Freeman & Co., S. Francisco, 1979).

    Google Scholar 

  6. M.R. Garey, D.S. Johnson, L. Stockmeyer: "Some simplified NP-complete graph problems"-Th. Comp. Sci. 1 (1976) pp. 240–243.

    Article  Google Scholar 

  7. F. Harary: Graph Theory-(Addison Wesley, Reading, 1969) p. 81.

    Google Scholar 

  8. B.W. Kernighan, S. Lin: "An efficient heuristic procedure for partitioning graphs"-Bell Syst. Tech. J. 49, 2 (1970) pp. 292–307.

    Article  Google Scholar 

  9. P.G.H. Lehot: An optimal algorithm to detect a line graph and output its root graph-J. ACM 21, 4 (1974) pp. 569–575.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Elettronica, Università di Roma "Tor Vergata", v. O. Raimondo, 00173, Roma, Italy

    Claudio Arbib

Authors
  1. Claudio Arbib
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Simeone

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Arbib, C. (1989). A polynomial algorithm for partitioning line-graphs. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083465

Download citation

  • DOI: https://doi.org/10.1007/BFb0083465

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51797-9

  • Online ISBN: 978-3-540-46810-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation