Sciweavers

SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
14 years 3 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
SWAT
1994
Springer
94views Algorithms» more  SWAT 1994»
14 years 3 months ago
On Self-Stabilizing Wait-Free Clock Synchronization
Protocols which can tolerate any number of processors failing by ceasing operation for an unbounded number of steps and resuming operation (with or) without knowing that they were...
Marina Papatriantafilou, Philippas Tsigas
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 3 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
14 years 3 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 3 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
14 years 3 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 3 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
14 years 3 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 3 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga