Denesting by Bounded Degree Radicals.

Johannes Blömer

Published in: Algorithmica (2000)

Keyphrases

bounded degree
graph theoretic
bounded treewidth
database
machine learning
social networks
database systems
natural language
graph theory
np hard
np complete