An O* (2(n)) algorithm for graph coloring and other partitioning problems via inclusion-exclusion

Mikko Koivisto

An O* (2(n)) algorithm for graph coloring and other partitioning problems via inclusion-exclusion

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

Alkuperäiskieli	englanti
Otsikko	47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS
Sivumäärä	8
Julkaisupäivä	2006
Sivut	583-590
ISBN (painettu)	0-7695-2720-5
Tila	Julkaistu - 2006
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	47th Annual IEEE Symposium on Foundations of Computer Science - Berkeley, Yhdysvallat (USA) Kesto: 21 lokakuuta 2006 → 24 lokakuuta 2006 Konferenssinumero: 47

Julkaisusarja

Nimi	Annual IEEE Symposium on Foundations of Computer Science
ISSN (painettu)	0272-5428

Lisätietoja

Volume:
Proceeding volume:

Tieteenalat

113 Tietojenkäsittely- ja informaatiotieteet

Siteeraa tätä

@inproceedings{b72917d6a35b4db7b7a0306ea427ec76,

title = "An O* (2(n)) algorithm for graph coloring and other partitioning problems via inclusion-exclusion",

keywords = "COUNT PATHS, MODELS, CYCLES, 113 Computer and information sciences",

author = "Mikko Koivisto",

note = " Volume: Proceeding volume: ; 47th Annual IEEE Symposium on Foundations of Computer Science ; Conference date: 21-10-2006 Through 24-10-2006",

year = "2006",

language = "English",

isbn = "0-7695-2720-5",

series = " Annual IEEE Symposium on Foundations of Computer Science",

pages = "583--590",

booktitle = "47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS",

}

Koivisto, M 2006, An O* (2(n)) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. julkaisussa 47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS. Annual IEEE Symposium on Foundations of Computer Science, Sivut 583-590, 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, Yhdysvallat (USA), 21/10/2006.

An O* (2(n)) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. / Koivisto, Mikko.

47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS. 2006. s. 583-590 ( Annual IEEE Symposium on Foundations of Computer Science).

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

TY - GEN

T1 - An O* (2(n)) algorithm for graph coloring and other partitioning problems via inclusion-exclusion

AU - Koivisto, Mikko

N1 - Conference code: 47

PY - 2006

Y1 - 2006

KW - COUNT PATHS

KW - MODELS

KW - CYCLES

KW - 113 Computer and information sciences

M3 - Conference contribution

SN - 0-7695-2720-5

T3 - Annual IEEE Symposium on Foundations of Computer Science

SP - 583

EP - 590

BT - 47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS

T2 - 47th Annual IEEE Symposium on Foundations of Computer Science

Y2 - 21 October 2006 through 24 October 2006

ER -