ResearchTrend.AI
349
0

Mining for trees in a graph is NP-complete

Jan Van den Bussche
ArXiv (abs)PDFHTML
Abstract

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

View on arXiv
Comments on this paper