Mining for trees in a graph is NP-complete

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Mining for trees in a graph is shown to be NP-complete.

Keywords

Databases, Artificial Intelligence, H.2.8

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/138953

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0709.4655
 http://arxiv.org/abs/0709.4655

Collections

arXiv