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

The file will be sent to you via the Telegram messenger. It may take up to 1-5 minutes before you receive it.

Note: Make sure you have linked your account to Z-Library Telegram bot.

The file will be sent to your Kindle account. It may take up to 1–5 minutes before you receive it.

Please note: you need to verify every book you want to send to your Kindle. Check your mailbox for the verification email from Amazon Kindle.