Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STACS
2009
Springer
10 years 8 months ago
Hardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
STACS
2009
Springer
10 years 8 months ago
A Polynomial Kernel for Multicut in Trees
Nicolas Bousquet, Jean Daligault, Stéphan T...
STACS
2009
Springer
10 years 8 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
STACS
2009
Springer
10 years 8 months ago
Cover Time and Broadcast Time
Robert Elsässer, Thomas Sauerwald
STACS
2009
Springer
10 years 8 months ago
On the Average Complexity of Moore's State Minimization Algorithm
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
Frédérique Bassino, Julien David, Cy...
STACS
2009
Springer
10 years 8 months ago
The Dynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
STACS
2009
Springer
10 years 8 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
STACS
2009
Springer
10 years 8 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...
STACS
2009
Springer
10 years 8 months ago
Reverse Engineering Prefix Tables
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
Julien Clément, Maxime Crochemore, Giuseppi...
books