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

Discrete Applied Mathematics

Volumn 73, Issue 1, 1997, Pages 27-34

  Cai, Leizhen ^a   Schieber, Baruch ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Bipartite graph; Graph algorithm; Odd cycle; Satisfiability problem

Indexed keywords

EID: 0041875855     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00074-1     Document Type: Article

References (11)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, (Addison-Wesley, Reading, MA, 1974).
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, (Addison-Wesley, Reading, Mass., 1983).
3. H.L. Bodlaender, On disjoint cycles, Internat. J. Found. Comput. Sci. 5 (1994) 69-97.
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, (North-Holland, New York, 1976).
5. L. Cai, Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties, Inform. Process. Lett. 58 (1996) 171-176.
6. R.G. Downey and M.R. Fellows, Fixed-Parameter Tractability and Completeness, I: Basic Results, SIAM J. Comput. 24 (1995) 873-921.
7. M.R. Garey and D.S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, (Freeman, San Francisco, CA, 1979).
8. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
9. H. Kaplan, R. Shamir, and R.E. Tarjan, Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping, Proceedings 35th IEEE Symp. on Foundations of Computer Science, Sante Fe, NM, (1994) 780-791.
10. R.M. Karp, Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972), 85-103.
11. T.J. Schaefer, The complexity of satisfiability problems, in Proceedings 10th ACM Symp. on Theory of Computing, (1978) 216-226.