The complexity of detecting fixed-density clusters (Q2499577): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.dam.2006.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048597630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent directions in netlist partitioning: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum independent sets by excluding subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum dispersion problem in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400856 / rank
 
Normal rank

Latest revision as of 19:03, 24 June 2024

scientific article
Language Label Description Also known as
English
The complexity of detecting fixed-density clusters
scientific article

    Statements

    The complexity of detecting fixed-density clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    density-based clustering
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    fixed-parameter problems
    0 references
    0 references