A linear-time algorithm for computing the intersection of all odd cycles in a graph
- 21 February 1997
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 73 (1), 27-34
- https://doi.org/10.1016/s0166-218x(96)00074-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mappingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- ON DISJOINT CYCLESInternational Journal of Foundations of Computer Science, 1994
- Data Structures and AlgorithmsScientific American, 1984
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972