396 search results - page 21 / 80 » An Optimal Minimum Spanning Tree Algorithm |
86
Voted
FSTTCS
1993
Springer
15 years 5 months ago
1993
Springer
120
Voted
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
135
Voted
NETWORKS
2010
15 years 5 days ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
128
click to vote
CATA
2004
15 years 3 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
153
click to vote
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...