مرکز منطقه ای اطلاع رساني علوم و فناوري - Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees : Information Processing Letters 49 (6) (22 March 1994) 303

Title of article :

Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees : Information Processing Letters 49 (6) (22 March 1994) 303–308

Author/Authors :

G. Sajith، نويسنده , , Sanjeev Saxena، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1995

Pages :

From page :

305

To page :

305

Journal title :

Information Processing Letters

Serial Year :

1995

Journal title :

Information Processing Letters

Record number :

128276

Link To Document :

https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128276