The matrix of maximum out forests of a digraph and its applications

Automation and Remote Control

Volumn 61, Issue 9 PART 1, 2000, Pages 1424-1450

  Agaev, R P ^a   Chebotarev, P Yu ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84902031544     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Harary, F., Graph Theory, Reading: Addison-Wesley, 1969.
2. Zykov, A.A., Teoriya konechnykh gragov (Theory of Finite Graphs), Novosibirsk: Nauka, 1969.
3. Tutte, W.T., Graph Theory, Reading: Addison-Wesley, 1984.
4. Schwartz, T., The Logic of Collective Choice, New York: Columbia Univ. Press, 1986.
5. Vol'skii, V.I., Choice of Best Alternatives on Directed Graphs and Tournaments, Avtom. Telemekh., 1988, no. 3, pp. 3-17.
6. Chebotarev, P.Yu. and Shamis, E.V., On Proximity Measures for Graph Vertices, Avtom. Telemekh., 1998, no. 10, pp. 113-133.
7. Chebotarev, P.Yu. and Shamis, E.V., The Matrix-Forest Theorem and Measuring Relations in Small Social Groups, Avtom. Telemekh., 1997, no. 9, pp. 124-136.
8. Fiedler, M. and Sedláček, J., O W-Basích Orientovaných Grafů, Časopis Pěst. Mat., 1958, vol. 83, pp. 214-225.
9. Gelfand, I.M., Lektsii po lineinoi algebre (Lectures on Linear Algebra), Moscow: Nauka, 1971.
10. Bollobás, B., Modern Graph Theory, New York: Springer, 1998.
11. Seary, A.J. and Richards, W.D., Partitioning Networks by Eigenvectors, Proc. Int. Conf. on Social Networks, London: Univ. of Greenwich Press, 1996, vol. 1, pp. 47-58.
12. Horn, R.A. and Johnson, C.R., Matrix Analysis, Cambridge: Cambridge Univ. Press, 1986.
13. Chebotarev, P.Yu. and Shamis, E.V., On a Duality Between Metrics and Σ-proximities, Avtom. Telemekh., 1998, no. 4, pp. 204-209.
14. David, H.A., The Method of Paired Comparisons, London: Griffin, 1988, 2nd ed.
15. David, H.A. and Andrews, D.M., Nonparametric Methods of Ranking from Paired Comparisons, in Probability Models and Statistical Analyses for Ranking Data, Fligner, M.A. and Verducci, J.S., Eds., New York: Springer, 1993, pp. 20-36.
16. Cook, W.D. and Kress, M., Ordinal Information and Preference Structures: Decision Models and Applications, Englewood Cliffs: Prentice-Hall, 1992.
17. Belkin, A.R. and Levin, M.S., Prinyatie reshenii: kombinatornye modeli approksimatsii informatsii (Decision Making: Combinatorial Models of Information Approximation), Moscow: Nauka, 1990.
18. Chebotarev, P.Yu. and Shamis, E., Constructing an Objective Function for Aggregating Incomplete Preferences, in Econometric Decision Models, Lecture Notes in Economics and Mathematical Systems, Tangian, A. and Gruber, J., Eds., Berlin: Springer, pp. 100-124.
19. Chebotarev, P.Yu. and Shamis, E., Preference Fusion when the Number of Alternatives Exceeds Two: Indirect Scoring Procedures, J. Franklin Inst., 1999, vol. 336, pp. 205-226; Erratum, J. Franklin Inst., 1999, vol. 336. pp. 747-748.
20. Chebotarev, P.Yu. and Shamis, E., Preference Fusion when the Number of Alternatives Exceeds Two: Indirect Scoring Procedures, J. Franklin Inst., 1999, vol. 336, pp. 205-226; Erratum, J. Franklin Inst., 1999, vol. 336. pp. 747-748.
21. Laslier, J.-F., Tournament Solutions and Majority Voting, Berlin: Springer, 1997.
22. Moon, J.W. and Pullman, N.J., On Generalized Tournament Matrices, SIAM Rev., 1970, vol. 12, pp. 384-399.
23. Berman, K.A., A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons, SIAM J. Algebraic Discrete Methods, 1980, vol. 1, pp. 359-361.
24. Maxwell, J.K., Electricity and Magnetism, London: Oxford Univ. Press, 1892, vol. 1, 3rd ed.