论文信息 - A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph

A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph

Abstract 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.

Baruch Schieber | Leizhen Cai | B. Schieber | L. Cai

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[3] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.

[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[5] Haim Kaplan,et al. Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[7] Leizhen Cai,et al. Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[8] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[11] Hans L. Bodlaender. On Disjoint Cycles , 1994, Int. J. Found. Comput. Sci..