Mining for trees in a graph is NP-complete
Databases
2007-10-01 v1 Artificial Intelligence
Authors:
Jan Van den Bussche
Abstract
Mining for trees in a graph is shown to be NP-complete.
Keywords
Cite
@article{arxiv.0709.4655,
title = {Mining for trees in a graph is NP-complete},
author = {Jan Van den Bussche},
journal= {arXiv preprint arXiv:0709.4655},
year = {2007}
}
Related papers
View all related →
Computational Complexity · Computer Science
Partitionability to two trees is NP-complete
Domotor Palvolgyi
2010-02-23
Computational Complexity · Computer Science
Treewidth is NP-Complete on Cubic Graphs (and related results)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop +5
2023-03-03
Computational Complexity · Computer Science
Recognizing Union-Find trees is NP-complete
Kitti Gelle, Szabolcs Ivan
2017-01-06
Data Structures and Algorithms · Computer Science
NP-Completeness Results for Graph Burning on Geometric Graphs
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
2021-02-02
Combinatorics · Mathematics
On the status sequences of trees
Aida Abiad, Boris Brimkov, Alexander Grigoriev
2020-02-03
Databases · Computer Science
Mining tree-query associations in graphs
Eveline Hoekx, Jan Van den Bussche
2010-08-17
Data Structures and Algorithms · Computer Science
Mining Patterns in Networks using Homomorphism
Anton Dries, Siegfried Nijssen
2015-03-19
Computational Complexity · Computer Science
On the NP-Completeness of Some Graph Cluster Measures
Jiri Sima, Satu Elisa Schaeffer
2007-05-23
Physics and Society · Physics
Trees = Networks ?!?
Luciano da Fontoura Costa, Francisco Aparecido Rodrigues
2008-08-07
Computational Geometry · Computer Science
Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures
Valentin E. Brimkov
2015-03-14
Combinatorics · Mathematics
Well-forced graphs
Cheryl Grood, Ruth Haas, Bonnie Jacob, Erika King +1
2023-12-25
Combinatorics · Mathematics
Thick Forests
Martin Dyer, Haiko Müller
2025-03-05
Data Structures and Algorithms · Computer Science
Complexity dichotomy on partial grid recognition
Vinícius G. P. de Sá, Guilherme D. da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
2012-04-13
Computational Complexity · Computer Science
NP-complete variants of some classical graph problems
Per Alexandersson
2020-01-14
Discrete Mathematics · Computer Science
Weighted Treedepth is NP-complete on Graphs of Bounded Degree
Jona Dirks, Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny
2026-02-05
Combinatorics · Mathematics
Degree Sequence Optimization in Bounded Treewidth
Shmuel Onn
2023-05-30
Discrete Mathematics · Computer Science
A note on minimal matching covered graphs
V. V. Mkrtchyan
2007-07-16
Combinatorics · Mathematics
Integral trees with given nullity
E. Ghorbani, A. Mohammadian, B. Tayfeh-Rezaie
2015-04-24
Data Structures and Algorithms · Computer Science
Finding Spanning Trees with Perfect Matchings
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi +1
2024-07-12
Combinatorics · Mathematics
Perfect Forests in Graphs and Their Extensions
Gregory Gutin, Anders Yeo
2021-07-09
Combinatorics · Mathematics
Alternative proof of upper bound of spanning trees in a graph
K. V. Chelpanov
2022-12-01
Discrete Mathematics · Computer Science
Note on Perfect Forests
Gregory Gutin
2015-01-07
Data Structures and Algorithms · Computer Science
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
Kitti Gelle, Szabolcs Ivan
2017-04-25
Combinatorics · Mathematics
A note on Matching-Cut in $P_t$-free Graphs
Carl Feghali
2022-05-17
Combinatorics · Mathematics
Counting Shellings of Complete Bipartite Graphs and Trees
Yibo Gao, Junyao Peng
2021-02-11