( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A linear algorithm for finding the k-broadcast center of a tree.

, , и . Networks, 53 (3): 287-292 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Lilit Harutyunyan

Davit Harutyunyan

Davit Harutyunyan

Gurgen Harutyunyan

Harutyun Harutyunyan

 

Другие публикации лиц с тем же именем

Messy broadcasting - Decentralized broadcast schemes with limited knowledge., , и . Discret. Appl. Math., 159 (5): 322-327 (2011)Multicast Algorithms in Torus Network., и . Applied Informatics, стр. 429-434. IASTED/ACTA Press, (2003)Broadcasting in necklace graphs., , и . C3S2E, стр. 253-256. ACM, (2009)A Heuristic for k-Broadcasting in Arbitrary Networks., и . IV, стр. 287-293. IEEE Computer Society, (2003)Broadcasting in interconnection networks based on node partitioning., и . MeditCom, стр. 234-239. IEEE, (2023)Broadcast Networks with Near Optimal Cost.. AAIM, том 8546 из Lecture Notes in Computer Science, стр. 312-322. Springer, (2014)Heuristic Algorithms with Near Optimal Broadcasting in Cactus Graphs., , и . PDP, стр. 253-257. IEEE, (2020)A New Fast Local Community Detection Algorithm Using the Number of Common Neighbours., и . SNAMS, стр. 1-8. IEEE, (2021)Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks., , и . PDPTA, стр. 178-182. CSREA Press, (2008)The Worst Case Behavior of Randomized Gossip., , , и . TAMC, том 7287 из Lecture Notes in Computer Science, стр. 330-345. Springer, (2012)