Sciweavers

491 search results - page 9 / 99
» On cyclically orientable graphs
Sort
View
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
13 years 7 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
JGT
2008
97views more  JGT 2008»
13 years 7 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
DCG
2000
79views more  DCG 2000»
13 years 7 months ago
Mutation Polynomials and Oriented Matroids
Several polynomials are of use in various enumeration problems concerning objects in oriented matroids. Chief among these is the Radon catalog. We continue to study these, as well ...
J. Lawrence
FOCI
2007
IEEE
14 years 1 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch
ICALP
2001
Springer
13 years 12 months ago
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. S...