![Raskraska ploskih grafov. Teoriya, metody, algoritmy Raskraska ploskih grafov. Teoriya, metody, algoritmy](/buxus/images/cache/product_image_large/products/A26222304.jpeg)
-
Ruský jazyk
Raskraska ploskih grafov. Teoriya, metody, algoritmy
Autor: Sergej Kurapow
V dannoj rabote dokazyvaetsya teorema o sushhestvovanii cvetnogo diska v ploskom kubicheskom grafe, prohodyashhego po dvum sceplennym rjobram, prinadlezhashhim izometricheskomu ciklu ili obodu grafa. Na osnove dokazannoj teoremy predstavleny algoritmy raskraski... Viac o knihe
Na objednávku, dodanie 2-4 týždne
50.85 €
bežná cena: 56.50 €
O knihe
V dannoj rabote dokazyvaetsya teorema o sushhestvovanii cvetnogo diska v ploskom kubicheskom grafe, prohodyashhego po dvum sceplennym rjobram, prinadlezhashhim izometricheskomu ciklu ili obodu grafa. Na osnove dokazannoj teoremy predstavleny algoritmy raskraski ploskih kubicheskih grafov v tri cveta. Kurapov S. V., Davidovsky M. V. The Coloring of Plane Graphs. Theory, Methods and Algorithms. In this monography we prove a theorem on the existence of a colored disk passing through the two linked edges belonging to an isometric cycle or a rim in a plane cubic graph. On the basis of the proved theorem the algorithms of planar graphs edge coloring with three colors are presented.
- Vydavateľstvo: LAP LAMBERT Academic Publishing
- Rok vydania: 2015
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Ruský jazyk
- ISBN: 9783659811241