<--- Back to Details
First PageDocument Content
Computational complexity theory / Parameterized complexity / Analysis of algorithms / Michael Fellows / Kernelization / Outerplanar graph / Clique / Connectivity / Tree decomposition / Graph theory / Theoretical computer science / Mathematics
Date: 2014-06-09 11:30:44
Computational complexity theory
Parameterized complexity
Analysis of algorithms
Michael Fellows
Kernelization
Outerplanar graph
Clique
Connectivity
Tree decomposition
Graph theory
Theoretical computer science
Mathematics

k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com

Add to Reading List

Source URL: fpt.wdfiles.com

Download Document from Source Website

File Size: 649,67 KB

Share Document on Facebook

Similar Documents

Clique Gossiping Yang Liu, Bo Li, Brian D. O. Anderson, and Guodong Shi∗ Abstract This paper proposes and investigates a framework for clique gossip protocols. As complete subnet-

DocID: 1vrYX - View Document

Clique trees of infinite locally finite chordal graphs Christoph Hofer-Temmel and Florian Lehner Abstract We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection betwee

DocID: 1vf3p - View Document

1. Je crée le compte de mon établissement Sur la page d’accueil du site, je clique sur « Inscription » Je clique sur

DocID: 1v5n9 - View Document

Manual de Acesso WEB Acesse o site: http://manager.fusp.org.br Escolha a opção “Coordenador” Digite seu CPF e senha e clique em “Entrar” Obs.: A senha deve ser cadastrada na fundação

DocID: 1v4x7 - View Document

Clique Is Hard on Average for Regular Resolution Albert Atserias Ilario Bonacina Susanna F. de Rezende

DocID: 1uqwl - View Document