Sciweavers

SIROCCO
2001
13 years 6 months ago
On Finding Minimum Deadly Sets for Directed Networks
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
Norbert Zeh, Nicola Santoro
COCOON
2003
Springer
13 years 9 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Jung-Heum Park, Hee-Chul Kim