Abstract
We compute the influence of a vertex on the connectivity structure of a directed network by using Shapley value theory. In general, the computation of such ratings is highly inefficient. We show how the computation can be managed for many practically interesting instances by a decomposition of large networks into smaller parts. For undirected networks, we introduce an algorithm that computes all vertex ratings in linear time, if the graph is cycle composed or chordal.
Please use the following format when citing this chapter: Abraham, M., Kötter, R., Krumnack, A., Wanke, E., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro. G., Bertossi. L., Kohayakwa. Y., (Boston: Springer), pp. 283–298.
Chapter PDF
Similar content being viewed by others
References
H.L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1–45, 1998.
X. Deng and C.H. Papadimitriou. On the complexity of cooperative solution concepts. Methods of Operations Research, 19(2):257–266, 1994.
G. Dirac. On rigid circuit graphs. Abh. Math. Sere. Univ. Hamburg, 25:71–76, 1961.
D.J. Felleman and D.C. Van Essen. Distributed hierarchical processing in the primate cerebral cortex. Cerebral Cortex, 1:1–47, 1991.
D.R. Fulkerson and O.A. Gross. Incidence matrices and interval graphs. Pacific J. Math., 15:835–855, 1965.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.
D. Gómez, E. González-Arangüena, C. Manuel, G. Owen, M. del Pozo, and J. Tejada. Splitting graphs when calculating Myerson value for pure overhead games. Mathematical Methods of Op. erations Research, 59:479–489, 2004.
A. Hajnal and J. Surányi. Über die Auflösung yon Graphen in vollständige Teilgraphen. Ann. Univ. Sci. Budapest, Eötös Sect. Math., 1:113–121, 1958.
R. Kötter and E. Wanke. Mapping brains without coordinates. Philosophical Transactions of the Royal Society London, Biological Sciences, 360(1456):751–766, 2000.
R.B. Myerson. Graphs an cooperations in games. Methods of Operations Research, 2:255–229, 1977.
S.D: Nikolopoulos and L. Palios. Hole and antihole detection in graphs. In Proceedings of the A CM-S[AM Symposium on Discrete Algorithms, pages 850–859. ACM-SIAM, 2004.
G. Owen. Values of graph-restricted games. SIAM Journal on Algebraic and Discrete Methods, 7(2):210–220, 1986.
N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309–322, 1986.
D.J. Rose. Triangulated graphs and elimination process. J. Math. Analys. Appl., 32:597–609, 1970.
D.J. Rose, R.E. Tarjan, and C.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266–283, 1976.
L.S. Shapley. A value for n-person games. In H.W. Kuhn and A.W. Tucker, editors, Contributions to the Theory of Games II, pages 307–317, Princeton, 1953. Princeton University Press.
R.E. Tarjan and M. annakakis. Simple linear-time algorithms to test chordality of graphs, acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13:566–579, 1984.
R. van den Brink and P. Borm. Digraph competitions and cooperative games. Theory and Decision, 53:327–342, 2002.
M. Wiegers. Recognizing outerplanar graphs in linear time. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 246 of LNCS, pages 165–176. Springer-Verlag, 1987.
K. Zilles. Architecture of the Human Cerebral Cortex. Regional and Laminar Oganization. In G. Paxinos and J.K. Mai, editors, The Human Nervous System, pages 997–1055, San Diego, CA, 2004. Elsevier. 2nd edition.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Abraham, M., Kötter, R., Krumnack, A., Wanke, E. (2006). A Connectivity Rating for Vertices in Networks. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_23
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)