Google Research

An Efficient Partitioning Oracle for Bounded-Treewidth Graphs

APPROX-RANDOM (2011), pp. 530-541

Abstract

No abstract available; check out the Download or Google Scholar links above for publications details.

Learn more about how we do research

We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work