Akademska digitalna zbirka SLovenije - logo
(UL)
  • Heuristic search for Hamilton cycles in cubic graphs
    Aleš, Janez, 1966- ; Mohar, Bojan, 1956- ; Pisanski, Tomaž
    A successful heuristic algorithm for finding Hamilton cycles in cubic graphs is described. Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of ... the group ▫$PSL_2(7)$▫ are shown to be hamiltonian.
    Vir: Preprint series. - ISSN 1318-4865 (Let. 28, št. 324, 1990, str. 1-6)
    Vrsta gradiva - članek, sestavni del
    Leto - 1990
    Jezik - angleški
    COBISS.SI-ID - 59647744

vir: Preprint series. - ISSN 1318-4865 (Let. 28, št. 324, 1990, str. 1-6)

loading ...
loading ...
loading ...