Counting unrooted maps using tree-decomposition
| dc.creator | Fusy, Eric | |
| dc.date | 2006-01-06 | |
| dc.date.accessioned | 2026-07-07T06:58:35Z | |
| dc.date.available | 2026-07-07T06:58:35Z | |
| dc.description | 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. | |
| dc.description | 32 pages, long version of a result presented at the conference FPSAC 05 | |
| dc.identifier | https://arxiv.org/abs/math/0601123 | |
| dc.identifier | http://arxiv.org/abs/math/0601123 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107414 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15; 05C30 | |
| dc.title | Counting unrooted maps using tree-decomposition | |
| dc.type | text |