Title of article :
Deciding k-colorability in expected polynomial time
Author/Authors :
Michael Krivelevich، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Pages :
6
From page :
1
To page :
6
Keywords :
Algorithms , graph coloring , Vector chromatic number , Average complexity
Journal title :
Information Processing Letters
Serial Year :
2002
Journal title :
Information Processing Letters
Record number :
129433
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129433
بازگشت