An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps

DOI10.1016/j.tcs.2010.04.026zbMath1192.68838arXiv0706.0969OpenAlexW1997658065WikidataQ60692285 ScholiaQ60692285MaRDI QIDQ982667

Samuel Alexandre Vidal

Publication date: 7 July 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0706.0969

zbMATH Keywords

triangular mapsCAT generatorexhaustive generatortrivalent diagrams

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Modular groups and planar maps ⋮ Asymptotics and random sampling for BCI and BCK lambda terms

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of unrooted odd-valent regular planar maps
• Une théorie combinatoire des séries formelles
• Intersection theory on the moduli space of curves and the matrix Airy function
• Counting rooted maps by genus. III: Nonseparable maps
• Hypermaps versus bipartite maps
• On associators and the Grothendieck-Teichmüller group. I
• Counting 1-vertex triangulations of oriented surfaces
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• The Euler characteristic of the moduli space of curves
• Enumeration of unrooted maps of a given genus
• Counting rooted maps by genus. I
• Generating Nonisomorphic Maps without Storing Them
• Three dimensional manifolds, Kleinian groups and hyperbolic geometry