1 citations · 5 across the 8 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
A unified algorithm for colouring graphs of bounded clique-width
Bruno Courcelle, Irène Durand, Michael Raskin
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two curren…
cs.CC2017★ 1 cited
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
Michael Raskin
Unambiguous non-deterministic finite automata have intermediate expressive power and succinctness between deterministic and non-deterministic automata. It has been conjectured that…