Counting unrooted maps using tree-decomposition

Details Counting unrooted maps using tree-decomposition Counting unrooted maps using tree-decomposition

2006-01-06

arxiv.org/abs/math/0601123v1

Mathematics

Combinatorics

32 pages, long version of a result presented at the conference FPSAC 05

Scientific paper

We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained maps. Tree-decomposition turns out to be very efficient and flexible for the enumeration of constrained families of maps. In this article, the method is applied to count unrooted 2-connected maps and, more importantly, to count unrooted 3-connected maps, which correspond to the combinatorial types of oriented convex polyhedra. Our method improves significantly on the previously best-known complexity to enumerate unrooted 3-connected maps.

Affiliated with

Also associated with

No associations

Rating

Counting unrooted maps using tree-decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting unrooted maps using tree-decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting unrooted maps using tree-decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110522