|
|
Article: New social science research reported from Southern Methodist University.
- Article from:
- Network Weekly News
- Article date:
- August 25, 2008
CopyrightCOPYRIGHT 2008 NewsRX. This material is published under license from the publisher through the Gale Group, Farmington Hills, Michigan. All inquiries regarding rights should be directed to the Gale Group. (Hide copyright information)
|
"We show that good community structures can be obtained by partitioning a social network in a succession of divisive sparsest cuts. A network flow algorithm based on fundamental principles of graph theory is introduced to identify the sparsest cuts and an underlying hierarchical community structure of the network via maximum concurrent flow," scientists in the United States report.
"Matula [Matula, David W., 1985. Concurrent flow and concurrent connectivity in graphs. In: Alavi, Y., et al. (Eds.), Graph Theory and its Applications to Algorithms and Computer Science. Wiley, New York, NY, pp. 543-559.] established the maximum concurrent flow problem (MCFP), and ...
Related newspaper, magazine, and journal articles:
|
|
Article: Research from Southern Methodist University has ...
Life Science Weekly;
March 3, 2009 ;
700+ words
... ... wrote K. Saggi and colleagues, Southern Methodist University. The researchers concluded ... information, contact K. Saggi, Southern Methodist University, Dept. of Economics ... States, Dallas, Life Sciences, Southern Methodist University. This article was prepared ...
|
|