An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three‐dimensional blockmodels / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Heuristics for finding \(k\)-clubs in an undirected graph / 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: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4714131 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3685214 / rank | |||
Normal rank |
Latest revision as of 10:56, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An exact algorithm for the maximum \(k\)-club problem in an undirected graph |
scientific article |
Statements
An exact algorithm for the maximum \(k\)-club problem in an undirected graph (English)
0 references
16 June 2002
0 references
maximum \(k\)-club problem
0 references
branch-and-bound algorithm
0 references