Maximum dispersion problem in dense graphs (Q5929139): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Quasi-Ramsey Numbers and Tournament Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum dispersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank

Revision as of 15:23, 3 June 2024

scientific article; zbMATH DE number 1588394
Language Label Description Also known as
English
Maximum dispersion problem in dense graphs
scientific article; zbMATH DE number 1588394

    Statements

    Maximum dispersion problem in dense graphs (English)
    0 references
    0 references
    2001
    0 references
    dispersion problem
    0 references
    algorithm
    0 references
    regularity lemma
    0 references
    approximation
    0 references
    weighted graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references