307 search results - page 33 / 62 » Finite locally-quasiprimitive graphs |
INFOCOM
1997
IEEE
14 years 2 months ago
1997
IEEE
A secret sharing schemefor the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsetsof ...
TCS
2008
13 years 9 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
AUTOMATICA
2008
13 years 10 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
DLT
2006
13 years 11 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
ACSD
2004
IEEE
14 years 1 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...