Abstract
The High degree subgraph problem is to find a subgraph H of a graph G such that the minimum degree of H is as large as possible. This problem is known to be P-hard so that parallel approximation algorithms are very important for it. Our first goal is to determine how effectively the approximation algorithm based on a well-known extremal graph result parallelizes. In particular, we show that two natural decision problems associated with this algorithm are P-complete: these results suggest that the parallel implementation of the algorithm itself requires more sophisticated techniques. Successively, we study the High degree subgraph problem for random graphs with any edge probability function and we provide different parallel approximation algorithms depending on the type of this function.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and J.H. Spencer (1992), The Probabilistic Method, Wiley-Interscience Publication.
R. Anderson, and E.W. Mayr (1984), “A P-complete problem and approximation to it”, Technical Report STAN-CS-84-1014, Department of Computer Science, Stanford University.
R. Anderson, and E.W. Mayr (1987), “Parallelism and greedy algorithms”, in Advances in Computing Research: Parallel and Distributed Computing, F.P. Preparata (ed.), JAI Press, 17–38.
B. Bollobas (1985), Random Graphs, Academic Press.
G. Bongiovanni, P. Crescenzi, S. De Agostino (1995), “MAX SAT and MIN SET COVER Approximation Algorithms are P-Complete”, Parallel Processing Letters, to appear.
D.P. Bovet, A. Clementi, P. Crescenzi, R. Silvestri (1995), “Parallel approximation algorithms for optimization problems”, Technical Report SI/R.R-95/09. Department of Computer Science, Rome University.
A. Clementi, J. Rolim, L. Kucera (1994), “A Note on Parallel Randomized Algorithms for Searching Problems”. DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences, American Mathematical Society, to appear.
P. Erdos (1963), “On the structure of linear graphs”. Israel Journal of Mathematics 1, 156–160.
R. Greenlaw (1989), “Ordered vertex removal and subgraph problems”, J. Comput. System Sci. 39, 323–342.
R. Greenlaw (1992), “A model classifying algorithms as inherently sequential with applications to graph searching”, Information and Computation 97, 133–149.
R. Greenlaw. H.J. Hoover, and W.L. Ruzzo (1995). Limits to parallel computation: P-completeness theory, Oxford University Press, to appear.
R.M. Karp and V. Ramachandran (1990), “Parallel algorithms for shared memory machines”, in Handbook of Theoretical Computer Science, J. van Leeuwen (ed.), MIT Press/Elsevier, Vol. A, 869–941.
D. Kavvadias. G.E. Pantziou, P.G. Spirakis, C. D. Zaroliagis (1994), “Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems”, Proc. of the 19th MFCS, LNCS, 462–472.
L.M. Kirousis. M.J. Serna, P. Spirakis (1989), “The parallel complexity of the connected subgraph problem”, Proc. 30th IEEE-FOCS, 446–456.
R.E. Ladner (1975), “The circuit value problem is log-space complete for P” SIGACT News 7, 18–21.
S. Nikoletseas, K. Palem, P. Spirakis. M. Yung (1994). “Short Vertex Disjoint paths and Multiconnectivity in Random Graphs: Reliable Networks Computing”, Proc. of the 21st ICALP, LNCS, 508–519.
K. Wagner (1970), Graphentheorie, Bibliographische Inst. AG.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreev, A.E., Clementi, A., Crescenzi, P., Dahlhaus, E., de Agostino, S., Rolim, J.D.P. (1995). The parallel complexity of approximating the High Degree Subgraph problem. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015416
Download citation
DOI: https://doi.org/10.1007/BFb0015416
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive