131
Voted
SWAT
15 years 4 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...
110
click to vote
SWAT
15 years 4 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...
108
click to vote
SWAT
15 years 4 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...
106
Voted
SWAT
15 years 4 months ago
1994 Springer 105
Voted
SWAT
15 years 4 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...
|
Algorithms