Алгоритмы раскраски плоских графов
Two algorithms for colouring a maximal planar graphs (plane triangulation) with four colours are proposed . The first algorithm is based on solving system of linear equations by the module 2, which finds one variant of colorings. The second algorithm is based on solving system of linear inequalities...
Saved in:
| Published in: | Теорія оптимальних рішень |
|---|---|
| Date: | 2006 |
| Main Author: | |
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2006
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/84965 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Алгоритмы раскраски плоских графов / Г.А. Донец // Теорія оптимальних рішень: Зб. наук. пр. — 2006. — № 5. — С. 136-144. — Бібліогр.: 5 назв. — рос. |
Institution
Digital Library of Periodicals of National Academy of Sciences of UkraineBe the first to leave a comment!