Interactive Partitioning System Demonstration, Short

  • Neal Lesh
  • Joe Marks
  • Maurizio Patrignani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)


Partitioning is often used to support better graph drawing; in this paper, we describe an interactive system in which graph drawing is used to support better partitioning. In our system the user is presented with a drawing of a current network partitioning, and is responsible for choosing appropriate optimization procedures and for focusing their application on portions of the network. Our pilot experiments show that our network drawings succeed in conveying some of the information needed by the human operator to steer the computation effectively, and suggest that interactive, human-guided search may be a useful alternative to fully automatic methods for network and graph partitioning.


  1. 1.
    C. J. Alpert. The ISPD98 circuit benchmark suite. In Proc. of the Intl. Symposium of Physical Design (ISPD’98), pages 80–85, 1998.Google Scholar
  2. 2.
    C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: A survey. Integration: The VLSI Journal, 19:1–81, 1995.MATHCrossRefGoogle Scholar
  3. 3.
    D. Anderson, E. Anderson, N. Lesh, J. Marks, B. Mirtich, D. Ratajczak, and K. Ryall. Human-guided simple search. To Appear in Proc. of AAAI 2000. Also
  4. 4.
    G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. In Proc. of the 36th Design Automation Conference, pages 343–348, 1999.Google Scholar
  5. 5.
    L. A. Sanchis. Multiple-way network partitioning. IEEE Trans. on Comp., 38:62–81, 1989.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Neal Lesh
    • 1
  • Joe Marks
    • 1
  • Maurizio Patrignani
    • 2
  1. 1.MERL — A Mitsubishi Electric Research LaboratoryCambridge
  2. 2.Dip. di Informatica e AutomazioneUniversitá di Roma TreRomeItaly

Personalised recommendations