2 ms·
It seems from the paper that their algorithm only needs to know the size of the input graph and nothing else. The lower bound is graph-theoretical and based on
by crocodilebamboo 3y ago
It seems from the paper that their algorithm only needs to know the size of the input graph and nothing else.
The lower bound is graph-theoretical and based on graph-parameters which are not considered by the algorithm.