A parallel maximum clique algorithm for large and massive sparse graphs (Q526419): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-016-1019-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2291939239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452109 / 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: An exact bit-parallel algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bit parallel exact maximum clique algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed approximate coloring in exact maximum clique search / 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 Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum clique: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-threading a state-of-the-art maximum clique algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for determining (generalized) core groups in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch and bound algorithm for the maximum labelled clique problem / rank
 
Normal rank

Latest revision as of 20:03, 13 July 2024

scientific article
Language Label Description Also known as
English
A parallel maximum clique algorithm for large and massive sparse graphs
scientific article

    Statements

    A parallel maximum clique algorithm for large and massive sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    massive
    0 references
    bitstring
    0 references
    branch-and-bound
    0 references
    maximum clique
    0 references
    parallel
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers