Sciweavers

2503 search results - page 158 / 501
» A study of 3-arc graphs
Sort
View
CSR
2010
Springer
15 years 11 months ago
Equilibria in Quantitative Reachability Games
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
Thomas Brihaye, Véronique Bruyère, J...
IPPS
2000
IEEE
15 years 11 months ago
Connectivity Models for Optoelectronic Computing Systems
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
Haldun M. Özaktas
JCT
2000
78views more  JCT 2000»
15 years 6 months ago
Discrete Green's Functions
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
Fan R. K. Chung, S.-T. Yau
JETAI
2002
71views more  JETAI 2002»
15 years 6 months ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
RSA
2008
78views more  RSA 2008»
15 years 6 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák