在图中挖掘树是 NP 完全的
数据库
2007-10-01 v1 人工智能
摘要
本文证明了在图中挖掘树的问题是 NP 完全的。
关键词
引用
@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}
}
相关论文
查看更多相关论文 →
计算复杂性 · 计算机科学
Partitionability to two trees is NP-complete
Domotor Palvolgyi
2010-02-23
计算复杂性 · 计算机科学
Treewidth is NP-Complete on Cubic Graphs (and related results)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop +5
2023-03-03
计算复杂性 · 计算机科学
Recognizing Union-Find trees is NP-complete
Kitti Gelle, Szabolcs Ivan
2017-01-06
数据结构与算法 · 计算机科学
NP-Completeness Results for Graph Burning on Geometric Graphs
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
2021-02-02
组合数学 · 数学
On the status sequences of trees
Aida Abiad, Boris Brimkov, Alexander Grigoriev
2020-02-03
数据库 · 计算机科学
Mining tree-query associations in graphs
Eveline Hoekx, Jan Van den Bussche
2010-08-17
数据结构与算法 · 计算机科学
Mining Patterns in Networks using Homomorphism
Anton Dries, Siegfried Nijssen
2015-03-19
计算复杂性 · 计算机科学
On the NP-Completeness of Some Graph Cluster Measures
Jiri Sima, Satu Elisa Schaeffer
2007-05-23
物理与社会 · 物理学
Trees = Networks ?!?
Luciano da Fontoura Costa, Francisco Aparecido Rodrigues
2008-08-07
计算几何 · 计算机科学
Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures
Valentin E. Brimkov
2015-03-14
组合数学 · 数学
Well-forced graphs
Cheryl Grood, Ruth Haas, Bonnie Jacob, Erika King +1
2023-12-25
组合数学 · 数学
Thick Forests
Martin Dyer, Haiko Müller
2025-03-05
数据结构与算法 · 计算机科学
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
计算复杂性 · 计算机科学
NP-complete variants of some classical graph problems
Per Alexandersson
2020-01-14
离散数学 · 计算机科学
Weighted Treedepth is NP-complete on Graphs of Bounded Degree
Jona Dirks, Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny
2026-02-05
组合数学 · 数学
Degree Sequence Optimization in Bounded Treewidth
Shmuel Onn
2023-05-30
离散数学 · 计算机科学
A note on minimal matching covered graphs
V. V. Mkrtchyan
2007-07-16
组合数学 · 数学
Integral trees with given nullity
E. Ghorbani, A. Mohammadian, B. Tayfeh-Rezaie
2015-04-24
数据结构与算法 · 计算机科学
Finding Spanning Trees with Perfect Matchings
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi +1
2024-07-12
组合数学 · 数学
Perfect Forests in Graphs and Their Extensions
Gregory Gutin, Anders Yeo
2021-07-09
组合数学 · 数学
Alternative proof of upper bound of spanning trees in a graph
K. V. Chelpanov
2022-12-01
离散数学 · 计算机科学
Note on Perfect Forests
Gregory Gutin
2015-01-07
数据结构与算法 · 计算机科学
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
Kitti Gelle, Szabolcs Ivan
2017-04-25
组合数学 · 数学
A note on Matching-Cut in $P_t$-free Graphs
Carl Feghali
2022-05-17
组合数学 · 数学
Counting Shellings of Complete Bipartite Graphs and Trees
Yibo Gao, Junyao Peng
2021-02-11