0 – 0 ( 0 ) Many-toOne Boundary Labeling
暂无分享,去创建一个
[1] Peter Eades,et al. Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.
[2] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[3] Frank Wagner,et al. A packing problem with applications to lettering of maps , 1991, SCG '91.
[4] Uriel Feige,et al. On the complexity of finding balanced oneway cuts , 2003, Inf. Process. Lett..
[5] Imrich Vrto,et al. One Sided Crossing Minimization Is NP-Hard for Sparse Graphs , 2001, GD.
[6] Michael A. Bekos,et al. Polygon labelling of minimum leader length , 2006, APVIS.
[7] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[8] Martin Nöllenburg,et al. Algorithms for Multi-criteria One-Sided Boundary Labeling , 2007, Graph Drawing.
[9] Alexander Wolff,et al. Boundary labeling: Models and efficient algorithms for rectangular maps , 2004, Comput. Geom..
[10] Bernard Chazelle. The Computational Geometry Impact Task Force Report: An Executive Summary , 1996, WACG.
[11] Yinyu Ye,et al. A .699-Approximation Algorithm for Max-Bisection , 1999 .
[12] Michael A. Bekos,et al. Boundary Labelling of Optimal Total Leader Length , 2005, Panhellenic Conference on Informatics.
[13] Michael A. Bekos,et al. BLer: A Boundary Labeller for Technical Drawings , 2005, Graph Drawing.
[14] E. Imhof. Positioning Names on Maps , 1975 .
[15] Alexander Wolff,et al. Map labeling heuristics: provably good and practically useful , 1995, SCG '95.
[16] Robert Krauthgamer,et al. A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[17] Gabriele Neyer. Map Labeling with Application to Graph Drawing , 1999, Drawing Graphs.
[18] Pravin M. Vaidya,et al. Geometry helps in matching , 1989, STOC '88.