84 search results - page 4 / 17 » Asymptotic enumeration of orientations |
GC
2006
Springer
13 years 8 months ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
DM
2010
13 years 8 months ago
2010
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
JDA
2006
13 years 8 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
COMBINATORICS
1999
13 years 7 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
CCCG
2010
13 years 9 months ago
2010