Sciweavers

3757 search results - page 83 / 752
» The overlap number of a graph
Sort
View
JCT
2008
103views more  JCT 2008»
14 years 10 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
ITA
2007
104views Communications» more  ITA 2007»
14 years 9 months ago
Automata, Borel functions and real numbers in Pisot base
This note is about functions f : Aω → Bω whose graph is recognized by a B¨uchi finite automaton on the product alphabet A × B. These functions are Baire class 2 in the Bair...
Benoit Cagnard, Pierre Simonnet
IAJIT
2011
14 years 1 months ago
On the genus of pancake network
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
Quan T. Nguyen, Saïd Bettayeb
ICCTA
2007
IEEE
15 years 1 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
AI
2011
Springer
14 years 5 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...