Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q56210432)
Watch
English
A fast algorithm for the maximum clique problem
No description defined
In more languages
edit
Statements
instance of
scholarly article
0 references
title
A fast algorithm for the maximum clique problem
(English)
0 references
author name string
Patric R.J. Östergård
series ordinal
1
0 references
language of work or name
English
0 references
publication date
August 2002
0 references
published in
Discrete Applied Mathematics
0 references
volume
120
0 references
issue
1-3
0 references
page(s)
197-207
0 references
maintained by WikiProject
WikiProject Mathematics
0 references
cites work
The maximum clique problem
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS0166-218X%2801%2900290-6
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
An exact algorithm for the maximum clique problem
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS0166-218X%2801%2900290-6
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Identifiers
DOI
10.1016/S0166-218X(01)00290-6
0 references
DBLP publication ID
journals/dam/Ostergard02
1 reference
stated in
DBLP Dataset 2021-01-02
retrieved
28 January 2021
zbMATH Open document ID
1019.05054
0 references
Sitelinks
Wikipedia
(0 entries)
edit
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit