Sciweavers

5473 search results - page 629 / 1095
» On the graph isomorphism problem
Sort
View
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
15 years 6 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
WG
2010
Springer
15 years 5 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
ISSTA
2012
ACM
13 years 9 months ago
Finding errors in multithreaded GUI applications
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
Sai Zhang, Hao Lü, Michael D. Ernst
RECOMB
2003
Springer
16 years 7 months ago
Towards optimally multiplexed applications of universal DNA tag systems
We study a design and optimization problem that occurs, for example, when single nucleotide polymorphisms (SNPs) are to be genotyped using a universal DNA tag array. The problem o...
Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, R...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
16 years 1 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...