Advertisement

Computational Complexity

  • Xueliang Li
  • Colton Magnant
  • Zhongmei Qin
Chapter
  • 318 Downloads
Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Abstract

First of all, we introduce some basis notions about computational complexity.

References

  1. 29.
    Ducoffe, G., Marinescu-Ghemeci, R., Popa, A.: On the (di)graphs with (directed) proper connection number two. Electron. Notes Discrete Math. 62, 237–242 (2017)MathSciNetCrossRefGoogle Scholar

Copyright information

© The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Xueliang Li
    • 1
  • Colton Magnant
    • 2
  • Zhongmei Qin
    • 3
  1. 1.Center for CombinatoricsNankai UniversityTianjinChina
  2. 2.Department of MathematicsGeorgia Southern UniversityStatesboroUSA
  3. 3.College of ScienceChang’an UniversityXi’anChina

Personalised recommendations