Chromatic number: Smallest number of need for coloring. Denoted as . Page 3. Lower bound. Theorem: For every deterministic online algorithm there ...
確定! 回上一頁