Parallel graph algorithms based upon broadcast communications

Yang, Chang‐Biau; Lee, R.C.T.; Chen, W.-T.

doi:10.1109/12.61071

Cited by 24 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Method to find distinctive topological sorts of directed acyclic graphs 1) Definition of topological sorts and coherent cut-sets: Consider a DAG G = (V, E). A topological sort is the assignment of an unique integer rank to each node of G, with the requirement that for every pair of distinct vertices [20]. R i and R j are the ranks of node i and j respectively.…”

Section: A Modelling Power Network As Directed Acyclic Graphsmentioning

confidence: 99%

“…One such benefit is the ability to calculate topological sorts for the networks' nodes. A topological sort means assigning an integer rank to each node in a directed acyclic graph so that, for every directed edge from node u to node v, u must rank before v in the ordering [20]. As one can define various assumptions for finding the topological sorts of a directed acyclic graph (DAG), many valid topological sorts could be obtained for a DAG [21], [22].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Topological Sorting Approach to Identify Coherent Cut-Sets Within Power Grids

Beiranvand

Cuffe

2020

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

This paper proposes a new technique to identify sets of branches that form heavily loaded and potentially vulnerable flowgates within power grids. To this end, a directed acyclic graph is used to model the instantaneous state of power grids. One of the advantages of directed acyclic graphs is they allow the identification of where power flows are coherent e.g where power flows in a uniform direction along a set of branches that partition the network into two islands. This paper uses topological sorts to identify many sets of branches having this property. Definitions are provided for two new concepts, termed coherent cut-sets and coherent crack-sets, which are particular sets of branches extracted from a specific topological sort. Notably, there are numerous possible topological sorts for a directed acyclic graph and calculating distinctive topological sorts is challenging. In this paper a novel optimization algorithm is proposed to find multiple, diverse topological sorts each of which implies many cut-sets. The effectiveness of the proposed methods for enhancing grid observability and situational awareness is demonstrated using two standard test networks.

show abstract

Section: A Modelling Power Network As Directed Acyclic Graphsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Topological Sorting Approach to Identify Coherent Cut-Sets Within Power Grids

Beiranvand

Cuffe

2020

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

show abstract

“…Sample computational problems solved on the conflict broadcast communication model include computing the extrema [20], sorting and selection [11], [24], [29], and graph theoretical problems [7], [33]. While many of these results were not stated in the context of MRN's, it is not hard to adapt them for this latter model.…”

Section: State Of the Artmentioning

confidence: 99%

Broadcast-efficient protocols for mobile radio networks

Nakano

Olariu

Schwing

1999

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

“…Some researchers regarded the model as the broadcast communication model [3-5, 7, 12, 15-19, 21, 22, 25, 26]. In the WNCD model some important and essential components have been investigated such as sorting algorithms [3,4,6,14,19,26], maximum finding algorithm [5,15] and graph algorithms [22,23,25]. The initialization problem [8,9] was discussed recently.…”

Section: Introductionmentioning

confidence: 99%

A Fast Initialization Algorithm for Single-Hop Wireless Networks

Shiau¹

2005

IEICE Transactions on Communications

View full text Add to dashboard Cite

Given a set of n stations, the initialization problem is to assign each station a unique identification number, from 1 to n. In the single-hop wireless Networks with collision detection, Nakano and Olariu proposed an algorithm to build a partition tree and solve the problem. In this paper, we shall classify the partition tree into four parts. By reviewing the classifications, we find that three ideas can improve the algorithm. We show that it needs 2.88n time slots for solving the problem containing n stations. After applying our three ideas, the number of time slots will be improved to 2.46n.

show abstract

Parallel graph algorithms based upon broadcast communications

Cited by 24 publications

References 9 publications

A Topological Sorting Approach to Identify Coherent Cut-Sets Within Power Grids

A Topological Sorting Approach to Identify Coherent Cut-Sets Within Power Grids

Broadcast-efficient protocols for mobile radio networks

A Fast Initialization Algorithm for Single-Hop Wireless Networks

Contact Info

Product

Resources

About