Sciweavers

33 search results - page 5 / 7
» endm 2008
Sort
View
ENDM
2008
80views more  ENDM 2008»
13 years 8 months ago
Polytopal complexes: maps, chain complexes and... necklaces
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
Frédéric Meunier
ENDM
2008
82views more  ENDM 2008»
13 years 8 months ago
Repetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
Said Sadique Adi, Marília D. V. Braga, Cris...
ENDM
2008
101views more  ENDM 2008»
13 years 8 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
ENDM
2010
87views more  ENDM 2010»
13 years 8 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
ENDM
2008
114views more  ENDM 2008»
13 years 8 months ago
Strong oriented chromatic number of planar graphs without cycles of specific lengths
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
Mickaël Montassier, Pascal Ochem, Alexandre P...