236
click to vote
SWAT
16 years 2 days ago
1994 Springer 
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...
223
click to vote
SWAT
16 years 2 days ago
1994 Springer 
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...
209
click to vote
SWAT
16 years 2 days ago
1994 Springer 
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...
202
click to vote
SWAT
16 years 2 days ago
1994 Springer
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...
201
click to vote
SWAT
16 years 2 days ago
1994 Springer 
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...
|
Algorithms