Skip to main content
SpringerLink
Log in

A New Approximation Technique for Hypergraph Partitioning Problem

  • Conference paper
Combinatorial Optimization

Part of the book series: NATO ASI Series ((NATO ASI F,volume 82))

  • 322 Accesses

Abstract

The partitioning of the nodes of a hypergraph arises in many different design/layout applications. In particular, the netlist partitioning problem in VLSI design, c.f. [2, 5, 9], can be represented as a hypergraph partitioning problem. The modules in the netlist correspond to nodes of the hypergraph and the nets correspond to the hyperedges.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
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. E. R. Barnes. An algorithm for partitioning the nodes of a graph. SIAM J. on Algebraic and Discrete Methods, 3 (4): 541–550, 1982.

    Article  MATH  Google Scholar 

  2. Brayton, R. K., G. Hactel, K. Mullen, and A. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Boston, 1984.

    Book  MATH  Google Scholar 

  3. Y. Chi. On partitioning and allocation problems for multiprocessor simulation. unpublished M.A.Sc. thesis, Department of Electrical and Computer Engineering, University of Waterloo, Ontario, 1989.

    Google Scholar 

  4. Fiduccia, C. M., and R. M. Mattheyses. A linear-time heuristic for improving network partitions. 19th Design Automation Conference, 175–181, 1982.

    Google Scholar 

  5. Friedman A D., and P. R. Menon. Theory and Design of Switching Circuits, Bell Telephone Laboratories and Computer Sciences Press, Rockville, MD, 1975.

    Google Scholar 

  6. Garey, M. R., and D. S. Johnson. Computers and Intractability, Freeman, San Francisco, CA., 1979.

    Google Scholar 

  7. Kernighan, B. W., and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J., 49 (2): 291–307, 1970.

    MATH  Google Scholar 

  8. Kusiak, A., A. Vanelli, and K. R. Kumar. Clustering analysis: Models and algorithms. Control and Cybernetics, 15 (2): 139–154, 1986.

    MathSciNet  MATH  Google Scholar 

  9. Russo, R. L., P. H. Oden, and P. K. Wolf, Sr. A heuristic procedure for the partitioning and mapping of computer logic blocks to modules. IEEE Trans. Comput., C-20: 1455–1462, 1971.

    Google Scholar 

  10. L. A. Sanchis. Multiple-way network partitioning. IEEE Trans. on Comput., 38 (1): 62–81, 1989.

    Article  MATH  Google Scholar 

  11. Vanelli, A., and S.W. Hadley. “A Gomory-Hu cut tree approach for partitioning netlist”. IEEE Trans. on Circuits and Systems, to appear July, 1990.

    Google Scholar 

  12. Vanelli, A., and S.W. Hadley. “An efficient procedure for partitioning the nodes of a hypergraph”. Under review SIAM J. on Discrete Mathematics, Jan., 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Universty of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

    Scott W. Hadley

Authors
  1. Scott W. Hadley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering, Bilkent University, 06533, Ankara, Turkey

    Mustafa Akgül

  2. Fachbereich Mathematik, Universität Kaiserslautern, Erwin-Schroedinger-Straße, W-6750, Kaiserslautern, Germany

    Horst W. Hamacher

  3. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, 32611-2083, Gainesville, FL, USA

    Süleyman Tüfekçi

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hadley, S.W. (1992). A New Approximation Technique for Hypergraph Partitioning Problem. In: Akgül, M., Hamacher, H.W., Tüfekçi, S. (eds) Combinatorial Optimization. NATO ASI Series, vol 82. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77489-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77489-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-77491-1

  • Online ISBN: 978-3-642-77489-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation