caa a22 4500 465821219 CHVBK 20180323112136.0 cr unu---uuuuu 170327e19900901xx s 000 0 eng 10.1007/BF01931660 doi (NATIONALLICENCE)springer-10.1007/BF01931660 Varadarajan Ravi Computer and Information Sciences Department, University of Florida, 32611, Gainesville, FL, USA aut Partitioning multi-edge graphs [Elektronische Daten] [Ravi Varadarajan] We introduce a new kind of graph called "multi-edge graph” which arises in many applications such as finite state Markov chains and broadcasting communication networks. A cluster in such a graph is a set of nodes such that for any ordered pair of nodes, there is a path of multi-edges from one to the other such that these edges remain within the same set. We give two algorithms to partition a multi-edge graph into maximal clusters. Both these algorithms are based on the depth-first search algorithm to find strongly connected components of the directed graph. We also discuss some applications of clustering in multi-edge graphs. BIT Foundations, 1990 F2.0 nationallicence G2.2 nationallicence Multi-edge graphs nationallicence Clusters nationallicence Depth-first search nationallicence Broadcast networks nationallicence BIT Numerical Mathematics Kluwer Academic Publishers 30/3(1990-09-01), 450-463 0006-3835 30:3<450 1990 30 10543 https://doi.org/10.1007/BF01931660 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01931660 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Varadarajan Ravi Computer and Information Sciences Department, University of Florida, 32611, Gainesville, FL, USA aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Kluwer Academic Publishers 30/3(1990-09-01), 450-463 0006-3835 30:3<450 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer