318 KB27 KB200820252014Hammack, Richard H.Imrich, Wilfriedštevilka:2letnik:7str. 487-497COBISSID:17164889ISSN:1855-3966URN:URN:NBN:SI:doc-KDKQY53LenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneaalgorithmsalgoritmigrafigraph productsteorija grafovFast recognition of direct and strong products|This note describes fast algorithms for computing the prime factors of connected, nonbipartite graphs with respect to the direct product, and of connected graphs with respect to the strong product. The complexities are ?$O(m \min(n^2, \Delta^3))$? for the direct product, and ?$O(m \; a(G) \Delta)$? for the strong, where ?$n$? is the order of the graph ?$G$? to be factored, ?$m$? its size, ?$a(G)$? its arboricity, and ?$\Delta$? its maximum degree. That is, the complexities are linear in ?$m$? for fixed ?$\Delta$?TEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije