A connectivity rating for vertices in networks

IFIP International Federation for Information Processing

Volumn 209, Issue , 2006, Pages 283-298

  Abraham, Marco ^a   Kötter, Rolf ^a   Krumnack, Antje ^a   Wanke, Egon ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION TECHNOLOGY;

CONNECTIVITY STRUCTURES; DIRECTED NETWORK; IN NETWORKS; LARGE NETWORKS; LINEAR TIME; SHAPLEY VALUE; UNDIRECTED NETWORK;

COMPUTATION THEORY;

EID: 33845666672     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-34735-6_23     Document Type: Article

References (20)

1. H.L. Bodlaender. A partial κ-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1-45, 1998.
2. X. Deng and C.H. Papadimitriou. On the complexity of cooperative solution concepts. Methods of Operations Research, 19(2):257-266, 1994.
3. G. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
4. D.J. Felleman and D.C. Van Essen. Distributed hierarchical processing in the primate cerebral cortex. Cerebral Cortex, 1:1-47, 1991.
5. D.R. Fulkerson and O.A. Gross. Incidence matrices and interval graphs. Pacific J. Math., 15:835-855, 1965.
6. 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.
7. 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 Operations Research, 59:479-489, 2004.
8. A. Hajnal and J. Surányi. Über die Auflösung von Graphen in vollständige Teilgraphen. Ann. Univ. Sci. Budapest, Eötvös Sect. Math., 1:113-121, 1958.
9. R. Kötter and E. Wanke. Mapping brains without coordinates. Philosophical Transactions of the Royal Society London, Biological Sciences, 360(1456):751-766, 2000.
10. R.B. Myerson. Graphs an cooperations in games. Methods of Operations Research, 2:255-229, 1977.
11. S.D: Nikolopoulos and L. Palios. Hole and antihole detection in graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 850-859. ACM-SIAM, 2004.
12. G. Owen. Values of graph-restricted games. SIAM Journal on Algebraic and Discrete Methods, 7(2):210-220, 1986.
13. N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986.
14. D.J. Rose. Triangulated graphs and elimination process. J. Math. Analys. Appl., 32:597-609, 1970.
15. D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266-283, 1976.
16. 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.
17. R.E. Tarjan and M. Yannakakis. 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.
18. R. van den Brink and P. Borm. Digraph competitions and cooperative games. Theory and Decision, 53:327-342, 2002.
19. 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.
20. 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.