A new algorithm for the maximum-weight clique problem

Patric R.J. Östergård

A new algorithm for the maximum-weight clique problem

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

Alkuperäiskieli	Englanti
Sivut	424-436
Julkaisu	Nordic Journal of Computing
Vuosikerta	8
Numero	4
Tila	Julkaistu - 2001
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Tutkimusalat

branch-and -bound algorithm
clique
graph algorithm

Siteeraa tätä

@article{1482b7bd50524221985b280b6751ca07,

title = "A new algorithm for the maximum-weight clique problem",

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

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

year = "2001",

language = "English",

volume = "8",

pages = "424--436",

journal = "Nordic Journal of Computing",

number = "4",

}

TY - JOUR

T1 - A new algorithm for the maximum-weight clique problem

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

PY - 2001

Y1 - 2001

KW - branch-and -bound algorithm

KW - clique

KW - graph algorithm

KW - branch-and -bound algorithm

KW - clique

KW - graph algorithm

KW - branch-and -bound algorithm

KW - clique

KW - graph algorithm

M3 - Article

VL - 8

SP - 424

EP - 436

JO - Nordic Journal of Computing

JF - Nordic Journal of Computing

IS - 4

ER -