Mining for trees in a graph is NP-complete
Jan Van den Bussche
TL;DR
This paper proves that the problem of finding trees within a graph is computationally NP-complete, indicating it is unlikely to have an efficient solution for all cases.
Contribution
The paper establishes the NP-completeness of the tree mining problem in graphs, providing a theoretical complexity classification.
Findings
Mining for trees in graphs is NP-complete
No known polynomial-time algorithms solve this problem in general
Complexity results guide future research directions
Abstract
Mining for trees in a graph is shown to be NP-complete.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Rough Sets and Fuzzy Logic · Advanced Database Systems and Queries