Repository: Freie Universität Berlin, Math Department

Browse by Authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Number of items: 7.

Article

Bodirsky, M. and Gröpl, C. and Kang, M. (2008) Generating unlabeled connected cubic planar graphs uniformly at random. Random Structures and Algorithms, 32 (2). pp. 157-180.

Bodirsky, M. and Gröpl, C. and Kang, M. (2007) Generating labeled planar graphs uniformly at random. Theoretical Computer Science, 379 (3). pp. 377-386.

Bodirsky, M. and Gröpl, C. and Johannsen, D. and Kang, M. (2007) A direct decomposition of 3-connected planar graphs. Séminaire Lotharingien de Combinatoire, B54Ak . 15 pages.

Conference or Workshop Item

Bodirsky, M. and Gröpl, C. and Kang, M. (2005) Sampling Unlabeled Biconnected Planar Graphs. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC05).

Bodirsky, M. and Gröpl, C. and Johannsen, D. and Kang, M. (2005) A direct decomposition of 3-connected planar graphs. In: Proceedings of the 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC05).

Bodirsky, M. and Gröpl, C. and Kang, M. (2003) Decomposing, Counting, and Generating Unlabeled Cubic Planar Graphs. In: European Conference on Combinatorics, Graph Theory, and Applications EUROCOMB'03 Prague.

Bodirsky, M. and Gröpl, C. and Kang, M. (2003) Generating labeled planar graphs uniformly at random. In: Proceedings of ICALP 2003.

This list was generated on Tue Jun 25 19:04:59 2019 CEST.