Kód: 17062845
We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circuit in graphs that have at least three vertices and minimum degree at least half ... celý popis
Angličtina
14.07 €
Bežne: 15.19 €
Ušetríte 1.12 €

Nákupom získate 34 bodov
Anotácia knihy
We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circuit in graphs that have at least three vertices and minimum degree at least half the total number of vertic
Parametre knihy
14.07 €
Angličtina
Osobný odber Bratislava a 12840 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )
Nachádzate sa: