Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time
Abstract
For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.
INRIA.HAL.SCIENCE Web Portal Publications, softwares... of Inria fellow Academics |
Alain Monteil : Connect in order to contact the contributor
https://inria.hal.science/hal-00795286
Submitted on : Wednesday, February 27, 2013-5:03:21 PM
Last modification on : Wednesday, September 6, 2023-10:42:10 AM