Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms

Research output: Book/Report › Report › Academic

Original language	Undefined/Unknown
Publisher	Department of Information and Computing Sciences, Utrecht University
Volume	UU-CS-2010-005
Publication status	Published - 2010

Cite this

@book{3c214a47703e4af3bdcbac43493c41da,

title = "Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms",

author = "{van Rooij}, J.M.M. and {van Kooten Niekerk}, M.E. and H.L. Bodlaender",

year = "2010",

language = "Undefined/Unknown",

volume = "UU-CS-2010-005",

publisher = "Department of Information and Computing Sciences, Utrecht University",

}

TY - BOOK

T1 - Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms

AU - van Rooij, J.M.M.

AU - van Kooten Niekerk, M.E.

AU - Bodlaender, H.L.

PY - 2010

Y1 - 2010

M3 - Report

VL - UU-CS-2010-005

BT - Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms

PB - Department of Information and Computing Sciences, Utrecht University

ER -