Finding Cactus Roots in Polynomial Time - Université de Lorraine Access content directly
Journal Articles Theory of Computing Systems Year : 2018

Finding Cactus Roots in Polynomial Time

Petr Golovach
Daniël Paulusma
Anthony Stewart
  • Function : Author

Domains

Automatic

Dates and versions

hal-03242338 , version 1 (31-05-2021)

Identifiers

Cite

Petr Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart. Finding Cactus Roots in Polynomial Time. Theory of Computing Systems, 2018, 62 (6), pp.1409-1426. ⟨10.1007/s00224-017-9825-2⟩. ⟨hal-03242338⟩
22 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More