Sciweavers

84 search results - page 4 / 17
» Asymptotic enumeration of orientations
Sort
View
GC
2006
Springer
14 years 9 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
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...
Linfan Mao, Yanpei Liu, Erling Wei
DM
2010
127views more  DM 2010»
14 years 9 months ago
Enumeration and limit laws of dissections on a cylinder
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 ...
Juanjo Rué
JDA
2006
59views more  JDA 2006»
14 years 9 months ago
A note on the complexity of minimum dominating set
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
Fabrizio Grandoni
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
14 years 9 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
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...
Anna Galluccio, Martin Loebl
CCCG
2010
14 years 11 months ago
Complete enumeration of small realizable oriented matroids
Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda