Code: 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 ... more
English
14.03 €
RRP: 15.15 €
You save 1.12 €

You get 34 loyalty points
Book synopsis
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
Book details
14.03 €
English
Collection points Bratislava a 13253 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
26510 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )
You are here: