Abstract
Subgraphs of a graph may have some special properties and detecting these subgraphs may be useful for various applications. In this chapter, we study theory and sequential, parallel, and distributed algorithms for three such special subgraphs: independent sets, dominating sets, and vertex cover.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Erciyes K (2013) Distributed graph algorithms for computer networks (Chap. 10). Computer communications and networks series, Springer, Berlin. ISBN 978-1-4471-5172-2
Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing (Chapter 10), 2nd edn. Addison Wesley, Reading
Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387
König D (1931) Graphen und Matrizen. Math Lapok 38:116119
Koufogiannakis C, Young N (2009) Distributed and parallel algorithms for weighted vertex cover and other covering problems. In: The 28th ACM SIGACT-SIGOPS symposium on principles of distributed computing (PODC 2009)
Luby M (1986) A simple parallel algorithm for the maximal independent set problem. SIAM J Comput 15(4):1036–1053
Parnas M, Ron D (2007) Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor Comput Sci 381(1):183–196
Rhodes N, Willett P, Calvet A, Dunbar JB, Humblet C (2003) Clip: similarity searching of 3d databases using clique detection. J Chem Inf Comput Sci 43(2):443448
Samudrala R, Moult J (2006) A graph-theoretic algorithm for comparative modeling of protein structure. J Mol Biol 279(1):287302
Stein C (2012) IEOR 8100. Lecture notes. Columbia University
Wattenhofer R (2016) Principles of distributed computing (Chapter 7). Class notes. ETH Zurich
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Erciyes, K. (2018). Independence, Domination, and Vertex Cover. In: Guide to Graph Algorithms. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-73235-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-73235-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73234-3
Online ISBN: 978-3-319-73235-0
eBook Packages: Computer ScienceComputer Science (R0)