[1]

He N., Li D.Y., Gan W.Y., Zhu X., Mining vital nodes in complex networks, Computer Science, 2007, 34(12): 1-5. Google Scholar

[2]

Even-Dar E., Shapira A., A note on maximizing the spread of influence in social networks, WINE 2007, LNCS 4858, 2007: 281-286. Google Scholar

[3]

Shetty J., Adibi J., Discovering Important Nodes through Graph Entropy The Case of Enron Email Database, The 3rd international workshop on Link discovery, Chicago, Illinois, 2005:74-81.Google Scholar

[4]

Nemhauser G., Wolsey L., Fisher M., An analysis of the approximations for maximizing submodular set functions, Mathematical Programming, 1978, 14(1): 265-294.CrossrefGoogle Scholar

[5]

Shapley L.S., A value for n-person games, In: Kuhn H W, Tucker A W (Eds.), Contributions to the Theory of Games II, Princeton University Press, 1953, 307-317. Google Scholar

[6]

Owen G., Values of games with a priori unions, In: Henn R, Moeschlin O (Eds.), Essays in mathematical economics and game theory, Springer-Verlag, Berlin, 1977, 76-88. Google Scholar

[7]

Scott J., Social Network Analysis: A Handbook (2nd ed), Sage, London, 2000. Google Scholar

[8]

Jean-Francois C., Network Games as TU Cooperative Games: The Core, the Shapley Value and Simple Network Games, 2009, http://centres.fusl.ac.be/CEREC/document/seminars/caulier_cerec_feb2009.pdf

[9]

Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, 2nd ed, Cambridge, MA: MIT Press, 2001.Google Scholar

[10]

Guimerà R., Amaral L.A.N., Functional cartography of complex metabolic networks, Nature, 2005, 433:895-900.CrossrefGoogle Scholar

[11]

Clauset A., Newman M.E.J., Moore C., Finding community structure in very large networks, PHYSICAL REVIEW E, 2004, 70(6): 066111 (6). CrossrefGoogle Scholar

[12]

Barabási A.L., Albert R., Emergence of scaling in random networks, Science, 1999, 286(5439): 509-512. CrossrefGoogle Scholar

[13]

Leskovec J., Kleinberg J., Faloutsos C., Graphs over time: Densification laws, shrinking diameters and possible explanations, The 11th ACM SIGKDD international conference on Knowledge discovery in data mining (KDD). Chicago, Illinois, USA, 2005: 177-187. Google Scholar

[14]

http://dblp.uni-trier.de/

[15]

Viswanath B., Mislove A., Cha M., Gummadi K.P., On the evolution of user interaction in Facebook, The 2nd ACM SIGCOMM Workshop on Social Networks(WOSN), Barcelona, Spain,2009: 37-42. Google Scholar

[16]

http://www-2.cs.cmu.edu/~enron/

[17]

Awadalla N.S., Hanna M.A., Ismail M.N., Period Variation Study and Light Curve Analysis of the Eclipsing Binary GSC 02013-00288, Applied Mathematics and Nonlinear Sciences, 2016, 1(2): 321–334.CrossrefGoogle Scholar

[18]

Chen Q., Chang H., Govindan R., Jamin S., Shenker S.J., Willinger W., The origin of power laws in Internet topologies revisited, The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, Los Alamitos, CA, USA, 2002: 608-617.Google Scholar

[19]

Watts D.J., Strogatz S.H., Collective dynamics of “small-world” networks, Nature, 1998, 393: 440-442. CrossrefGoogle Scholar

[20]

Rosa M., Gandarias M.L., Multiplier method and exact solutions for a density dependent reaction-diffusion equation, Applied Mathematics and Nonlinear Sciences, 2016, 1(2):311–320. CrossrefGoogle Scholar

[21]

Mislove A., Marcon M., Gummadi K.P., Druschel P., Bhattacharjee B., Measurement and analysis of online social networks, The 7th ACM SIGCOMM conference on Internet measurement conference (IMC), San Diego, California, USA, 2007: 29-42. Google Scholar

## Kommentare (0)

Allgemeiner Hinweis: Durch die Nutzung der Kommentarfunktion auf degruyter.com erklären Sie sich mit unserer Datenschutzerklärung einverstanden. Wir legen Wert auf einen respektvollen Umgang miteinander. Daher möchten wir Sie gerne auf unsere Hausregeln aufmerksam machen.