pith. sign in

arxiv: 0709.4655 · v1 · submitted 2007-09-28 · 💻 cs.DB · cs.AI

Mining for trees in a graph is NP-complete

Jan Van den Bussche This is my paper
classification 💻 cs.DB cs.AI
keywords graphminingnp-completetrees
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.