当前位置: X-MOL 学术J. ACM › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Detecting an Odd Hole
Journal of the ACM ( IF 2.3 ) Pub Date : 2020-01-29 , DOI: 10.1145/3375720
Maria Chudnovsky 1 , Alex Scott 2 , Paul Seymour 1 , Sophie Spirkl 3
Affiliation  

We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.

中文翻译:

检测奇数孔

我们给出了一个多项式时间算法来测试一个图是否包含一个长度大于三且奇数的诱导循环。
更新日期:2020-01-29
down
wechat
bug