Interactive Partitioning System Demonstration, Short

Lesh, Neal and Marks, Joe and Patrignani, Maurizio (2001) Interactive Partitioning System Demonstration, Short. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 31-36 (Official URL:

Full text not available from this repository.


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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-44541-2_4
Classifications:M Methods > M.300 Dynamic / Incremental / Online
S Software and Systems > S.999 Others
ID Code:282

Repository Staff Only: item control page


C. J. Alpert. The ISPD98 circuit benchmark suite. In Proc. of the Intl. Symposium of Physical Design (ISPD'98), pages 80-85, 1998.

C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: A survey. Integration: The VLSI Journal, 19:1-81, 1995.

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

G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. In Proc. of the 36th Design Automation Conference, pages 343-348, 1999.

L. A. Sanchis. Multiple-way network partitioning. IEEE Trans. on Comp., 38:62-81, 1989.