4 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Stefan Kratsch, Florian Nelles
We study the influence of a graph parameter called modular-width on the time complexity for optimally solving well-known polynomial problems such as Maximum Matching, Triangle Coun…