Abstract
Finding complete subgraphs of an undirected graph is another fundamental problem with a variety of interesting applications in diverse scientific and engineering disciplines. Clique algorithms also find application in the comparison of structures described by trees or graphs and, as a matter of fact, finding maximal and maximum cliques is the basis of the algorithms discussed in Chap. 7 for finding maximal and maximum common subgraph isomorphisms between two graphs.
If you really need to find the largest clique in a graph, an exhaustive search via backtracking provides the only real solution.
—Steven S. Skiena [304]
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Valiente, G. (2002). Clique, Independent Set, and Vertex Cover. In: Algorithms on Trees and Graphs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04921-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-04921-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07809-5
Online ISBN: 978-3-662-04921-1
eBook Packages: Springer Book Archive