129 search results - page 19 / 26 » Cyclic Haar graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
JCT
2008
14 years 9 months ago
2008
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...
81
Voted
DM
2007
14 years 9 months ago
2007
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
JSW
2008
14 years 9 months ago
2008
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
87
Voted
SMI
2010
IEEE
14 years 8 months ago
2010
IEEE
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...