202
click to vote
SWAT
15 years 11 months 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...
192
click to vote
SWAT
15 years 11 months 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...
177
click to vote
SWAT
15 years 11 months 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...
175
click to vote
SWAT
15 years 11 months ago
1994 Springer
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...
174
click to vote
SWAT
15 years 11 months 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...
|
Algorithms