Sciweavers

Share
FSTTCS
2000
Springer
9 years 7 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
FSTTCS
2000
Springer
9 years 7 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
FSTTCS
2000
Springer
9 years 7 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen
FSTTCS
2000
Springer
9 years 7 months ago
Combining Semantics with Non-standard Interpreter Hierarchies
This paper reports on results concerning the combination of non-standard semantics via interpreters. We define what a semantics combination means and identify under which condition...
Sergei M. Abramov, Robert Glück
FSTTCS
2000
Springer
9 years 7 months ago
Data Provenance: Some Basic Issues
The ease with which one can copy and transform data on the Web, has made it increasingly di cult to determine the origins of a piece of data. We use the term data provenance to ref...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
books