Google Research

Solving the 2-disjoint connected subgraphs problem faster than 2n

Proceedings of the 10th Latin American international conference on Theoretical Informatics, Springer-Verlag, Berlin, Heidelberg (2012), pp. 195-206

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