Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
DOI10.1007/978-3-319-53925-6_1zbMATH Open1487.05254OpenAlexW2588222785MaRDI QIDQ2980894FDOQ2980894
Authors: Etsuji Tomita 
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_1
Recommendations
- scientific article; zbMATH DE number 2040957
- Exact algorithms for maximum clique: a computational study
- Efficient algorithms for finding maximum cliques of an overlap graph
- A fast algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- Algorithm Theory - SWAT 2004
- Efficient algorithms for clique problems
- An algorithm for finding a maximum clique in a graph
- A new algorithm for the maximum clique problem
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- Algorithm 457: finding all cliques of an undirected graph
- The maximum clique problem
- Title not available (Why is that?)
- A New Algorithm for Generating All the Maximal Independent Sets
- On cliques in graphs
- Clique-detection models in computational biochemistry and genomics
- Improvements to MCS algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- Title not available (Why is that?)
- An effective local search for the maximum clique problem
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Clique relaxation models in social network analysis
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Infra-chromatic bound for exact maximum clique search
- Fast local search for the maximum independent set problem
- Algorithm Theory - SWAT 2004
- Computing and Combinatorics
- Finding a Maximum Independent Set
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Listing all maximal cliques in large sparse real-world graphs
Cited In (10)
- An Efficient Algorithm for Enumerating Pseudo Cliques
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Refined pivot selection for maximal clique enumeration in graphs
- Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
- A review on algorithms for maximum clique problems
- Exact algorithms for maximum clique: a computational study
- An algorithm for reporting maximal \(c\)-cliques
Uses Software
This page was built for publication: Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980894)
