Algorithms for Drawing Clustered Graphs (1997)

Cached

Download Links

by Qingwen Feng
Citations:25 - 2 self

Active Bibliography

59 Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs – Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi - 1999
11 Output-Sensitive Reporting of Disjoint Paths – Giuseppe Di Battista, Roberto Tamassia, Luca Vismara - 1996
521 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
477 An algorithm for drawing general undirected graphs – Tomihisa Kamada, Satoru Kawai - 1989
524 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
952 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
2279 The capacity of wireless networks – Piyush Gupta, P. R. Kumar - 2000
659 Routing with Guaranteed Delivery in ad hoc Wireless Networks – Prosenjit Bose, Pat Morin, Ivan Stojmenovińá, Jorge Urrutia - 2001
2474 Compositional Model Checking – E. M. Clarke, D. E. Long, K. L. Mcmillan - 1999