Advertisement

The Monotone Circuit Value Problem with Bounded Genus Is in NC

  • Faisal N. Abu-Khzam
  • Shouwei LiEmail author
  • Christine Markarian
  • Friedhelm Meyer auf der Heide
  • Pavel Podlipyan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9797)

Abstract

We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].

Keywords

Directed Acyclic Graph Sink Node Vertex Cover Input Graph Layer Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

We wish to thank the anonymous referees for their valuable comments to improve the structure and presentation of this paper.

References

  1. 1.
    Battle, J., Harary, F., Kodama, Y.: Additivity of the genus of a graph. Bull. Am. Math. Soc. 68(6), 565–568 (1962)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Cesati, M., Di Ianni, M.: Parameterized parallel complexity. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol. 1470, pp. 892–896. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40), 3736–3756 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inf. Control 64(1), 2–22 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of bodlaender and courcelle. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 143–152. IEEE (2010)Google Scholar
  7. 7.
    Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. SIGACT News 9(2), 25–29 (1977)CrossRefzbMATHGoogle Scholar
  8. 8.
    Klein, P.N., Reif, J.H.: An efficient parallel algorithm for planarity. J. Comput. Syst. Sci. 37(2), 190–246 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Ladner, R.E.: The circuit value problem is log space complete for P. SIGACT News 7(1), 18–20 (1975)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Limaye, N., Mahajan, M., Sarma, J.M.: Upper bounds for monotone planar circuit value and variants. Comput. Complex. 18(3), 377–412 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Ramachandran, V., Yang, H.: An efficient parallel algorithm for the general planar monotone circuit value problem. SIAM J. Comput. 25(2), 312–339 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14(4), 862–874 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Yang, H.: An NC algorithm for the general planar monotone circuit value problem. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp. 196–203, December 1991Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Faisal N. Abu-Khzam
    • 1
    • 4
  • Shouwei Li
    • 2
    Email author
  • Christine Markarian
    • 3
  • Friedhelm Meyer auf der Heide
    • 2
  • Pavel Podlipyan
    • 2
  1. 1.Department of Computer Science and MathematicsLebanese American UniversityBeirutLebanon
  2. 2.Heinz Nixdorf Institute and Department of Computer SciencePaderborn UniversityPaderbornGermany
  3. 3.Department of Mathematical SciencesHaigazian UniversityBeirutLebanon
  4. 4.School of Engineering and Information TechnologyCharles Darwin UniversityDarwinAustralia

Personalised recommendations