Editing Cyclomatic number (section)

=== Parametrized complexity ===
Some computational problems on graphs are NP-hard in general, but can be solved in [[polynomial time]] for graphs with a small cyclomatic number. An example is the path reconfiguration problem.<ref>{{citation | last1 = Demaine | first1 = Erik D. | author1-link = Erik Demaine | last2 = Eppstein | first2 = David | author2-link = David Eppstein | last3 = Hesterberg | first3 = Adam | last4 = Jain | first4 = Kshitij | last5 = Lubiw | first5 = Anna | author5-link = Anna Lubiw | last6 = Uehara | first6 = Ryuhei | last7 = Uno | first7 = Yushi | editor1-last = Friggstad | editor1-first = Zachary | editor2-last = Sack | editor2-first = Jörg-Rüdiger | editor2-link = Jörg-Rüdiger Sack | editor3-last = Salavatipour | editor3-first = Mohammad R. | arxiv = 1905.00518 | contribution = Reconfiguring Undirected Paths | doi = 10.1007/978-3-030-24766-9_26 | pages = 353–365 | publisher = Springer | series = Lecture Notes in Computer Science | title = Algorithms and Data Structures – 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings | title-link = SWAT and WADS conferences | volume = 11646 | isbn = 978-3-030-24765-2 | year = 2019}}</ref>