当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
NP-complete variants of some classical graph problems
arXiv - CS - Computational Complexity Pub Date : 2020-01-13 , DOI: arxiv-2001.04120
Per Alexandersson

Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are shown to be NP-complete. Our proofs use straightforward reduction from $3$-SAT.

中文翻译:

一些经典图问题的 NP 完全变体

一些经典的图问题,例如寻找最小生成树、最短路径或最大流,可以有效地完成。我们描述了这些问题的细微变化,这些变化被证明是 NP 完全的。我们的证明使用从 $3$-SAT 直接减少。
更新日期:2020-01-14
down
wechat
bug