An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees

1985 ◽  
Author(s):  
F. Chin ◽  
H. F. Ting
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Linear Time ◽  
Minimum Weight

A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

1998 ◽  
Vol 27 (1) ◽  
pp. 302-316 ◽  
Author(s):  
Juan A. Garay ◽  
Shay Kutten ◽  
David Peleg
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Weight

scholarly journals A Distributed Algorithm for Minimum-Weight Spanning Trees

1983 ◽  
Vol 5 (1) ◽  
pp. 66-77 ◽  
Author(s):  
R. G. Gallager ◽  
P. A. Humblet ◽  
P. M. Spira
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Weight

A Distributed Algorithm for Minimum Weight Spanning Trees. Revision

1979 ◽  
Author(s):  
R. G. Gallager ◽  
P. A. Humblet ◽  
P. M. Spira
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Weight

scholarly journals Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 293
Author(s):  
Xinyue Liu ◽  
Huiqin Jiang ◽  
Pu Wu ◽  
Zehui Shao
Keyword(s):  
Linear Time ◽  
Minimum Weight ◽  
Domination Number ◽  
Time Algorithm ◽  
Simple Graph ◽  
Linear Time Algorithm ◽  
Domination Problem ◽  
Np Complete ◽  
Chordal Bipartite Graphs ◽  
Dominating Function

For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v)≠0 has a neighbor u with f(u)≠0 for every vertex v∈V(G). The weight of a TR3DF f is the sum f(V)=∑v∈V(G)f(v) and the minimum weight of a total Roman {3}-dominating function on G is called the total Roman {3}-domination number denoted by γt{R3}(G). In this paper, we show that the total Roman {3}-domination problem is NP-complete for planar graphs and chordal bipartite graphs. Finally, we present a linear-time algorithm to compute the value of γt{R3} for trees.

scholarly journals A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees

2020 ◽  
Vol 16 (1) ◽  
pp. 1-27
Author(s):  
Gopal Pandurangan ◽  
Peter Robinson ◽  
Michele Scquizzato
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Spanning Trees
Sign in / Sign up

Export Citation Format

Share Document