Maximum Independent Set in Graphs of Average Degree at Most Three in $O(1.08537^n)$

N. Bourgeois, B. Escoffier, V.Th. Paschos, J.M.M. van Rooij

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	Undefined/Unknown
Title of host publication	7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010
Editors	J. Kratochvíl, A. Li, J. Fiala, P. Kolman
Publisher	Springer
Pages	373-384
Number of pages	12
Publication status	Published - 2010

Cite this

@inproceedings{f6d4769d531543aa93fa858f5df0c9b3,

title = "Maximum Independent Set in Graphs of Average Degree at Most Three in $O(1.08537^n)$",

author = "N. Bourgeois and B. Escoffier and V.Th. Paschos and {van Rooij}, J.M.M.",

note = "BourgeoisEPR10a",

year = "2010",

language = "Undefined/Unknown",

pages = "373--384",

editor = "J. Kratochv{\'i}l and A. Li and J. Fiala and P. Kolman",

booktitle = "7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010",

publisher = "Springer",

address = "Germany",

}

Maximum Independent Set in Graphs of Average Degree at Most Three in $O(1.08537^n)$. / Bourgeois, N.; Escoffier, B.; Paschos, V.Th. et al.
7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010. ed. / J. Kratochvíl; A. Li; J. Fiala; P. Kolman. Springer, 2010. p. 373-384.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Maximum Independent Set in Graphs of Average Degree at Most Three in $O(1.08537^n)$

AU - Bourgeois, N.

AU - Escoffier, B.

AU - Paschos, V.Th.

AU - van Rooij, J.M.M.

N1 - BourgeoisEPR10a

PY - 2010

Y1 - 2010

M3 - Conference contribution

SP - 373

EP - 384

BT - 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010

A2 - Kratochvíl, J.

A2 - Li, A.

A2 - Fiala, J.

A2 - Kolman, P.

PB - Springer

ER -