crocodilebamboo·3 anni fa·discussIt 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.
The lower bound is graph-theoretical and based on graph-parameters which are not considered by the algorithm.