A fast algorithm for finding the compact sets
A fast algorithm for finding the compact sets
Autori:
Časopis: Information Processing Letters
Volume, no: 38 , 6
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90092-V
Stranice: 339-342
Link: https://www.sciencedirect.com/science/article/abs/pii/002001909190092V?via%3Dihub
Apstrakt:
We define and investigate the problem of finding all compact sets in a complete, weighted, undirected graph with n vertices. An algorithm with worst-case complexity of O(n^2 log N) is given for the problem.
Ključne reči: Design of algorithms, analysis of algorithms, program correctness, graph algorithms, compact sets
Kategorije objave:
Bibliografske reference nastavnika Univerziteta Singidunum
Zahvaljujemo se što ste preuzeli publikaciju sa portala Singipedia.
Ukoliko želite da se prijavite za obaveštenja o sadržajima iz oblasti ove publikacije, možete nam ostaviti adresu svoje elektronske pošte.