Author:
Edachery Jubin,Sen Arunabha,Brandenburg Franz J.
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Lect Notes Comput Sci;F. J. Brandenburg,1997
2. J. S. Deogun, D. Kratsch and G. Steiner, “An approximation algorithm for clustering graphs with dominating diametral paths,” Information Processing Letters, 61, pp. 121–127, 1997.
3. P. Eades, “Multilevel Visualization of Clustered Graphs,” Proceedings of Graph Drawing’96, Berkeley, California, September,1996.
4. M. R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Publishers, San Francisco, 1978.
5. D. W. Matula and L.L. Beck, “Smallest-last ordering and clustering and graph coloring algorithms,” Journal of the Association of Computing Machinery 30 pp. 417–427, 1983.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献