Sciweavers

187 search results - page 8 / 38
» Coloring linear orders with Rado's partial order
Sort
View
IPL
2008
169views more  IPL 2008»
13 years 8 months ago
Oriented colorings of partial 2-trees
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
Pascal Ochem, Alexandre Pinlou
IEEECGIV
2005
IEEE
14 years 2 months ago
Surface Modelling Using Fourth Order Geometric Flows
We use two fourth order geometric partial differential equations to efficiently solve several surface modelling problems, including the surface blending, the N-sided hole fillin...
Guoliang Xu, Qing Pan
LATA
2010
Springer
13 years 6 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
JSYML
2007
100views more  JSYML 2007»
13 years 8 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
PPAM
2007
Springer
14 years 2 months ago
On Parallel Generation of Partial Derangements, Derangements and Permutations
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
Zbigniew Kokosinski