Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: IsoRank / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UbiCrawler / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WebGraph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Codes for the World Wide Web / 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: Q2753729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithm for Enumerating Maximal Cliques in Complex Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / 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: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's in a crowd? Analysis of face-to-face behavioral networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Up Algorithms on Compressed Web Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters / 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: Components in time-varying graphs / 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: The maximum clique problem / 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: Exact algorithms for maximum clique: a computational study / 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 efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / 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: Q5687246 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/14100018x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1823437338 / rank
 
Normal rank

Latest revision as of 11:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Parallel Maximum Clique Algorithms with Applications to Network Analysis
scientific article

    Statements

    Parallel Maximum Clique Algorithms with Applications to Network Analysis (English)
    0 references
    0 references
    0 references
    27 October 2015
    0 references
    parallel maximum clique algorithms
    0 references
    branch-and-bound
    0 references
    network analysis
    0 references
    temporal strong components
    0 references
    graph compression
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references