Broadcasting is the process of dissemination of a message from one vertex (called
originator) to all other vertices in the graph. This task is accomplished by placing a sequence …

This paper deals with the 2-maxian problem on cactus graphs. It is shown that in the worst
case the midpoint of any path connecting m 1 and m 2, where {m 1, m 2} is the 2-maxian of …

A subset M of vertices of a graph is called a static monopoly, if any vertex v outside M has at
least ⌈ 1 2\deg (v) ⌉⌈ 1 2 deg (v)⌉ neighbors in M. The minimum static monopoly problem …

The development of tools based on robust mathematical models to deal with real-world,
computationally intractable problems has increasingly aligned with combinatorial …

We present the first streaming algorithm for the longest path problem in undirected graphs.
The input graph is given as a stream of edges and RAM is limited to only a linear number of …

Over the last century, telecommunication networks have become the nervous system of our
society. As data is generated and stored on varied nodes, effective communication is …

A Linear Time Algorithm for Computing Longest Paths in 2-Trees Page 1 A Linear Time
Algorithm for Computing Longest Paths in 2-Trees Minko Markov∗ Tzvetalin Vassilev† Krassimir …

Since the early days of computing, computers have been used to solve certain problems in
speeds that are unattainable by humans. Initially digital computers where designed using a …

In chapter 2, we consider a generalization of the well-known Maker-Breaker triangle game
for uniform hypergraphs in which Maker tries to build a triangle by choosing one edge in …

Good communication between the units in a communication network or among the
proccessors in a parallel system is essential for the proper functioning. There are various …