Sciweavers

310 search results - page 35 / 62
» dam 2008
Sort
View
DAM
2000
101views more  DAM 2000»
13 years 9 months ago
The complexity of irredundant sets parameterized by size
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...
Rodney G. Downey, Michael R. Fellows, Venkatesh Ra...
DAM
2002
120views more  DAM 2002»
13 years 9 months ago
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
Daniela Ferrero, Carles Padró
DAM
2002
125views more  DAM 2002»
13 years 9 months ago
Complexity of Langton's ant
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
Anahí Gajardo, Andrés Moreira, Eric ...
DAM
2002
78views more  DAM 2002»
13 years 9 months ago
Uniquely 2-list colorable graphs
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
DAM
2002
72views more  DAM 2002»
13 years 9 months ago
On the bound for anonymous secret sharing schemes
In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on t...
Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Waka...