Back to Results
First PageMeta Content
Graph operations / Tree decomposition / Decomposition method / Path decomposition / Parameterized complexity / Constraint satisfaction problem / Bipartite graph / Hypertree / Hypergraph / Graph theory / Theoretical computer science / Constraint programming


Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenij Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man In
Add to Reading List

Document Date: 2013-06-06 21:34:11

Open Document

File Size: 633,04 KB

Share Result on Facebook

Company

Vertex / Dagstuhl Publishing / EMC / Evgenij Thorstensen1 1 Computing Laboratory / /

Country

Germany / /

/

Facility

University of Oxford / Oxford Man Institute / /

IndustryTerm

polynomial algorithm / maximum solution / linear algorithm / polynomial algorithms / mathematical tool / constraint network / model-checking tools / concrete parallel algorithm / logical tools / /

MusicGroup

U2 / /

Organization

University of Oxford / US Federal Reserve / Oxford Man Institute of Quantitative Finance / /

Person

Tien Lee / Gottlob / Carsten Thomassen / /

Position

General / /

ProgrammingLanguage

Datalog / /

PublishedMedium

Theoretical Computer Science / /

Technology

solution algorithm / linear algorithm / polynomial algorithms / Db-Shunt algorithm / artificial intelligence / relational database / concrete parallel algorithm / polynomial algorithm / /

SocialTag