Sciweavers

COCOA
2010
Springer
13 years 3 months ago
Bipartite Permutation Graphs Are Reconstructible
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
COCOA
2010
Springer
13 years 3 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
COCOA
2010
Springer
13 years 3 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
COCOA
2010
Springer
13 years 9 days ago
Termination of Multipartite Graph Series Arising from Complex Network Modelling
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
Matthieu Latapy, Thi Ha Duong Phan, Christophe Cre...
COCOA
2010
Springer
13 years 3 months ago
The Union of Colorful Simplices Spanned by a Colored Point Set
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
André Schulz, Csaba D. Tóth
Discrete Geometry
Top of PageReset Settings