Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2588222785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for the maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to MCS algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up branch and bound algorithms for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxation Models in Social Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infra-chromatic bound for exact maximum clique search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank

Latest revision as of 19:13, 13 July 2024

scientific article
Language Label Description Also known as
English
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
scientific article

    Statements

    Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (English)
    0 references
    0 references
    5 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    enumeration of all maximal cliques
    0 references
    branch-and-bound depth-first search algorithms
    0 references
    0 references