Maintaining hierarchical graph views

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Maintaining hierarchical graph views

Full text

Pdf (986 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms table of contents

San Francisco, California, United States

Pages: 566 - 575

Year of Publication: 2000

ISBN:0-89871-453-2

Authors

Adam L. Buchsbaum	AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ
Jefferey R. Westbrook	AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 43, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	j. Abello. Navigating graph surfaces. In Proc. 4th ICIAM, page 234, 1999.
	2	Omer Berkman , Uzi Vishkin, Finding level-ancestors in trees, Journal of Computer and System Sciences, v.48 n.2, p.214-230, April 1994 [doi>10.1016/S0022-0000(05)80002-9]
	3	Giuseppe Di Battista , Peter Eades , Roberto Tamassia , Ioannis G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall PTR, Upper Saddle River, NJ, 1998
	4	E E Dietz. Finding level-ancestors in dynamic trees. In Proc. 2nd WADS, volume 519 of LNCS, pages 32--40. Springer- Verlag, 1991.
	5	Martin Dietzfelbinger , Anna Karlin , Kurt Mehlhorn , Friedhelm MeyerAuf Der, Dynamic Perfect Hashing: Upper and Lower Bounds, SIAM Journal on Computing, v.23 n.4, p.738-761, Aug. 1994 [doi>10.1137/S0097539791194094]
	6	Peter Eades , Qing-Wen Feng, Multilevel Visualization of Clustered Graphs, Proceedings of the Symposium on Graph Drawing, p.101-112, September 18-20, 1996
	7	Peter Eades , Qing-Wen Feng , Xuemin Lin, Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, Proceedings of the Symposium on Graph Drawing, p.113-128, September 18-20, 1996
	8	P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proc. Compugraphics '91, pages 24-33, 1991.
	9	Harold N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.434-443, January 22-24, 1990, San Francisco, California, United States
	10	David Harel, On visual formalisms, Communications of the ACM, v.31 n.5, p.514-530, May 1988 [doi>10.1145/42411.42414]
	11	Dov Harel , Robert Endre Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, v.13 n.2, p.338-355, May 1984 [doi>10.1137/0213024]
	12	Mao Lin Huang , Peter Eades, A Fully Animated Interactive System for Clustering and Navigating Huge Graphs, Proceedings of the 6th International Symposium on Graph Drawing, p.374-383, August 01, 1998
	13	Tamara Munzner, Drawing Large Graphs with H3Viewer and Site Manager, Proceedings of the 6th International Symposium on Graph Drawing, p.384-393, August 01, 1998
	14	S. North. Drawing ranked digraphs with recursive clusters. In Proc. ALCOOM Wks. on Graph Drawing, 1993.
	15	Baruch Schieber , Uzi Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM Journal on Computing, v.17 n.6, p.1253-1262, Dec. 1988 [doi>10.1137/0217079]
	16	Margaret-Anne D. Storey , Hausi A. Müller, Graph Layout Adjustment Strategies, Proceedings of the Symposium on Graph Drawing, p.487-499, September 20-22, 1995
	17	Kozo Sugiyama , Kazuo Misue, A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR, Proceedings of the Symposium on Graph Drawing, p.500-503, September 20-22, 1995
	18	Robert Endre Tarjan, Applications of Path Compression on Balanced Trees, Journal of the ACM (JACM), v.26 n.4, p.690-715, Oct. 1979 [doi>10.1145/322154.322161]
	19	University of Minnesota PowerWall, 1998. http://www.lcse.- umn.edu/research/powerwall/powerwall.html.

CITED BY 6

	Irene Finocchi , Rossella Petreschi, Divider-based algorithms for hierarchical tree partitioning, Discrete Applied Mathematics, v.136 n.2-3, p.227-247, 15 February 2004
	Steven Noel , Sushil Jajodia, Managing attack graph complexity through visual hierarchical aggregation, Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security, October 29-29, 2004, Washington DC, USA
	Manuel Freire , Pilar Rodríguez, A graph-based interface to complex hypermedia structure visualization, Proceedings of the working conference on Advanced visual interfaces, May 25-28, 2004, Gallipoli, Italy
	Lars Arge , Gerth Stølting Brodal , Laura Toma, On external-memory MST, SSSP and multi-way planar graph separation, Journal of Algorithms, v.53 n.2, p.186-206, November 2004
	Andreas Noack , Claus Lewerentz, A space of layout styles for hierarchical graph models of software systems, Proceedings of the 2005 ACM symposium on Software visualization, May 14-15, 2005, St. Louis, Missouri
	Bhavana Bharat Dalvi , Meghana Kshirsagar , S. Sudarshan, Keyword search on external memory data graphs, Proceedings of the VLDB Endowment, v.1 n.1, August 2008