A linear-time algorithm for computing the intersection of all odd cycles in a graph

被引：7
|
作者：
Cai, LZ
Schieber, B
机构：
[1] IBM CORP, DIV RES, TJ WATSON RES CTR, YORKTOWN HTS, NY 10598 USA
[2] CHINESE UNIV HONG KONG, DEPT COMP SCI & ENGN, SHATIN, NT, HONG KONG
来源：
DISCRETE APPLIED MATHEMATICS | 1997年 / 73卷 / 01期
关键词：
graph algorithm; odd cycle; bipartite graph; satisfiability problem;
D O I：
10.1016/S0166-218X(96)00074-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.
引用
收藏
页码：27 / 34
页数：8
相关论文
共 50 条
12345