Asymptotic bounds for clustering problems in random graphs (Q6196888): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.22203 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4389742209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turan's Graph Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense subgraphs in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3003675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1--5, 2013. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network analysis. Methodological foundations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2k\) kernel for the cluster editing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent union of cliques problem: complexity and exact approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Club Polytope of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum quasi-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique relaxation models in network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of induced open triangles in graphs of a given order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Based Clique Relaxations in Networks: s-Clique and s-Club / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the minimum \(s\)-club partitioning problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:45, 28 August 2024

scientific article; zbMATH DE number 7819294
Language Label Description Also known as
English
Asymptotic bounds for clustering problems in random graphs
scientific article; zbMATH DE number 7819294

    Statements

    Asymptotic bounds for clustering problems in random graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 March 2024
    0 references
    asymptotic bounds
    0 references
    independent union of cliques
    0 references
    network analysis
    0 references
    network clusterability
    0 references
    uniform random graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers