Optimizing regular edge labelings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6502 LNCS, Issue , 2011, Pages 117-128

  Buchin, Kevin ^a   Speckmann, Bettina ^a   Verdonschot, Sander ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC CHIPS; FLOORPLANS; LABELINGS; OPTIMIZATION PROBLEMS; QUALITY CRITERIA; TREE-MAPS; UPPER AND LOWER BOUNDS; NEAR-OPTIMAL; REGULAR EDGE LABELING;

ARCHITECTURAL DESIGN; DRAWING (GRAPHICS); TRIANGULATION; OPTIMIZATION;

OPTIMIZATION; SURVEYING;

EID: 79952263929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18469-7_11     Document Type: Conference Paper

References (24)

1. Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Search Methodologies, pp. 187-210. Springer, Heidelberg (2005)
2. Ackerman, E., Barequet, G., Pinter, R.Y.: A bijection between permutations and floorplans, and its applications. Disc. Appl. Math. 154(12), 1674-1684 (2006)
3. Aichholzer, O., Hackl, T., Vogtenhuber, B., Huemer, C., Hurtado, F., Krasser, H.: On the number of plane graphs. In: Proc. 17th SODA, pp. 504-513 (2006)
4. Amano, K., Nakano, S., Yamanaka, K.: On the number of rectangular drawings: Exact counting and lower and upper bounds. TR 2007-AL-115, IPSJ SIG (2007)
5. Avis, D., Fukuda, K.: Reverse search for enumeration. Disc. Appl. Math. 65(1), 21-46 (1996)
6. Bhasker, J., Sahni, S.: A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 7, 307-317 (1987)
7. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 198-209. Springer, Heidelberg (2006)
8. Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 97-107. Springer, Heidelberg (2007)
9. Buchin, K., Schulz, A.: On the number of spanning trees a planar graph can have. In: Proc. 18th ESA (to appear, 2010), arXiv/0912.0712
10. Chung, F.R.K., Graham, R.L., Frankl, P., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. J. Comb. Theory, Ser. A 43(1), 23-37 (1986)
11. Eppstein, D., Mumford, E.: Orientation-constrained rectangular layouts. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 49-60. Springer, Heidelberg (2009)
12. Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. In: Proc. 25th ACM Symp. Comp. Geom., pp. 267-276 (2009)
13. Felsner, S., Zickfeld, F.: On the number of planar orientations with prescribed degrees. Electron. J. Comb. 15(1), Research paper R77, 41 (2008)
14. Fujimaki, R., Inoue, Y., Takahashi, T.: An asymptotic estimate of the numbers of rectangular drawings or floorplans. In: Proc. ISCAS, pp. 856-859 (2009)
15. Fusy, É.: Transversal structures on triangulations: A combinatorial study and straight-line drawings. Disc. Math. 309(7), 1870-1894 (2009)
16. Horn, R., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
17. Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. TCS 172(1-2), 175-193 (1997)
18. Kirkpatrick, S.: Optimization by simulated annealing: Quantitative studies. J. Statistical Physics 34(5), 975-986 (1984)
19. Koźmiński, K., Kinnen, E.: Rectangular dual of planar graphs. Networks 5, 145-157 (1985)
20. Minc, H.: Nonnegative Matrices. Wiley-Interscience, Hoboken (1988)
21. Peuquet, D., Ci-Xiang, Z.: An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane. Pattern Rec. 20(1), 65-74 (1987)
22. Speckmann, B., van Kreveld, M., Florisson, S.: A linear programming approach to rectangular cartograms. In: Progress in Spatial Data Handling: Proc. 12th International Symposium on Spatial Data Handling, pp. 529-546 (2006)
23. van Kreveld, M., Speckmann, B.: On rectangular cartograms. Computational Geometry: Theory and Applications 37(3), 175-187 (2007)
24. Yeap, G.K.H., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM J. Discrete Mathematics 8(2), 258-280 (1995)