Sciweavers

1883 search results - page 186 / 377
» Ordered theta graphs
Sort
View
LICS
2005
IEEE
14 years 1 months ago
Ludics Nets, a game Model of Concurrent Interaction
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
Claudia Faggian, François Maurel
HT
1997
ACM
14 years 8 days ago
Collective Phenomena in Hypertext Networks
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...
Valery M. Chelnokov, Victoria L. Zephyrova
JSC
2007
63views more  JSC 2007»
13 years 8 months ago
On the geometry of parametrized bicubic surfaces
We start the study of the problem of describing the double point locus of a bicubic surface. Our motivation is to determine, whether a real bicubic patch over the unit square will...
André Galligo, Michael Stillman
RSA
2011
92views more  RSA 2011»
13 years 3 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...