Search Results - "Harutyunyan, Hovhannes A."

Messy Broadcasting in Grid by Adibi, Aria, Harutyunyan, Hovhannes A.

“…In classical broadcast models, information is disseminated in synchronous rounds under the constant communication time model, wherein a node may only inform…”
Get full text

A new metric to compare local community detection algorithms in social networks using geodesic distance by Bakhtar, Sahar, Harutyunyan, Hovhannes A.

“…Community detection problem is a well-studied problem in social networks. One major question to this problem is how to evaluate different community detection…”
Get full text

Dynamic Local Community Detection Algorithms by Bakhtar, Sahar, Harutyunyan, Hovhannes A.

“…Recent years have witnessed the rapid growth of social network services. Real-world social networks are huge and changing over time. Consequently, the problems…”
Get full text

Efficient broadcast trees for weighted vertices by Harutyunyan, Hovhannes A., Kamali, Shahin

“…In this paper, we consider a weighted-vertex model for information dissemination in communication networks. Each node of the network (e.g., a processing…”
Get full text

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing by Harutyunyan, Hovhannes A., Terzian, Meghrig

“…Summary Multicast communication constrained by end‐to‐end and interdestination delay variation is known as delay and delay variation–bounded multicast. These…”
Get full text

Tight lower bounds on broadcast function for n = 24 and 25 by Barsky, Georgy, Grigoryan, Hayk, Harutyunyan, Hovhannes A.

Get full text

Diametral broadcast graphs by Grigoryan, Hayk, Harutyunyan, Hovhannes A.

“…This paper studies the family of graphs with broadcast time equal to their diameter. The diametral broadcast graph (dbg) problem is to answer the question…”
Get full text

Upper bounds on the broadcast function using minimum dominating sets by Harutyunyan, Hovhannes A., Liestman, Arthur L.

“…We construct new upper bounds on the broadcast function B(n), the number of edges in a minimum broadcast graph on n vertices, for a large class of integers n…”
Get full text

The worst case behavior of randomized gossip protocols by Baumann, Hervé, Fraigniaud, Pierre, Harutyunyan, Hovhannes A., de Verclos, Rémi

“…This paper considers the quasi-random rumor spreading model introduced by Doerr, Friedrich, and Sauerwald in [10], hereafter referred to as the list-based…”
Get full text

An Efficient Vertex Addition Method for Broadcast Networks by Harutyunyan, Hovhannes A.

“…Broadcasting is a basic problem of communication in usual networks. Many papers have investigated the construction of minimum broadcast networks, the cheapest…”
Get full text

Minimum multiple message broadcast graphs by Harutyunyan, Hovhannes A.

“…Multiple message broadcasting is the process of multiple message dissemination in a communication network in which m messages, originated by one vertex, are…”
Get full text

On broadcasting in unicyclic graphs by Harutyunyan, Hovhannes A., Maraachlian, Edward

“…Broadcasting is an information dissemination problem in a connected network, in which one node, called the originator , disseminates a message to all other…”
Get full text

Messy broadcasting — Decentralized broadcast schemes with limited knowledge by Harutyunyan, Hovhannes A., Hell, Pavol, Liestman, Arthur L.

“…We consider versions of broadcasting that proceed in the absence of information about the network. In particular, the vertices of the network do not know the…”
Get full text

Broadcasting in interconnection networks based on node partitioning by Harutyunyan, Hovhannes A., Hovhannisyan, Narek

“…Broadcasting is one of the information dissemination primitives where a message is passed from one node (called originator) to all other nodes in the network…”
Get full text

Broadcasting in chains of rings by Harutyunyan, Hovhannes A., Hovhannisyan, Narek, Maraachlian, Edward

“…Broadcasting is an information dissemination problem in an interconnection network where one node, called the originator, must distribute a message to all…”
Get full text

A Fast Local Community Detection Algorithm in Signed Social Networks by Bakhtar, Sahar, Harutyunyan, Hovhannes A.

“…Recent years have witnessed the rapid growth of social network services and consequently, research problems investigated in this area. Community detection is…”
Get full text

Fully-adaptive Model for Broadcasting with Universal Lists by Gholami, Saber, Harutyunyan, Hovhannes A.

“…In classical broadcasting, a piece of information must be transmitted to all entities of a network as quickly as possible, starting from a particular member…”
Get full text

Nonadaptive broadcasting in trees by Harutyunyan, Hovhannes A., Liestman, Arthur L., Makino, Kazuhisa, Shermer, Thomas C.

“…We study nonadaptive broadcasting in trees, a process of sending a message from one vertex in a tree to all other vertices. In the nonadaptive model, each…”
Get full text

A linear algorithm for finding the k-broadcast center of a tree by Harutyunyan, Hovhannes A., Liestman, Arthur L., Shao, Bin

“…The term k‐broadcast indicates the process of disseminating a message from one vertex to all vertices of a graph in such a way that in each time unit, an…”
Get full text

A Broadcasting Heuristic for Hypercube of Trees by Gholami, Saber, Harutyunyan, Hovhannes A.

“…Broadcasting is the process of dissemination of information in a network where a particular message is sent starting from an originator. The ultimate objective…”
Get full text