Sciweavers

2503 search results - page 73 / 501
» A study of 3-arc graphs
Sort
View
ICDCIT
2005
Springer
15 years 11 months ago
Cleaning an Arbitrary Regular Network with Mobile Agents
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
Paola Flocchini, Amiya Nayak, Arno Schulz
ISAAC
2004
Springer
94views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Error Compensation in Leaf Root Problems
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
PC
2000
93views Management» more  PC 2000»
15 years 5 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
CPC
2010
74views more  CPC 2010»
15 years 3 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
15 years 11 months ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...