88 search results - page 4 / 18 » The Secrecy Graph and Some of its Properties |
EJC
2007
13 years 5 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
CAAN
2004
Springer
13 years 11 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...