A Fast Algorithm for the maximum clique problem

P.R.J. Östergård

A Fast Algorithm for the maximum clique problem

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

Alkuperäiskieli	Englanti
Otsikko	30th South-Eastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA, 8.-12.3.1999
Tila	Julkaistu - 1999
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa

Tutkimusalat

branch-and-bound algorithm
graph algorithm
maximum clique problem

Siteeraa tätä

@inproceedings{768eda8d1618445c90f88719b0b0b446,

title = "A Fast Algorithm for the maximum clique problem",

keywords = "branch-and-bound algorithm, graph algorithm, maximum clique problem, branch-and-bound algorithm, graph algorithm, maximum clique problem, branch-and-bound algorithm, graph algorithm, maximum clique problem",

author = "P.R.J. {\"O}sterg{\aa}rd",

year = "1999",

language = "English",

booktitle = "30th South-Eastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA, 8.-12.3.1999",

}

TY - GEN

T1 - A Fast Algorithm for the maximum clique problem

AU - Östergård, P.R.J.

PY - 1999

Y1 - 1999

KW - branch-and-bound algorithm

KW - graph algorithm

KW - maximum clique problem

KW - branch-and-bound algorithm

KW - graph algorithm

KW - maximum clique problem

KW - branch-and-bound algorithm

KW - graph algorithm

KW - maximum clique problem

M3 - Conference article in proceedings

BT - 30th South-Eastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA, 8.-12.3.1999

ER -