This dissertations presents an algorithm on the webgraph for finding dense bipartite graphs wich represents web-communities.
By performing further steps of the algorithm several levels of communities are recognized which can be related to communites of former levels.
The web can be represented by a graph with special regions: SCC, IN, OUT and TENDRILS.
Regions are defined by the link-path-reach from one website to others.
The linkage to and from a website (in- and out-degree) seems to conform the power law, which is also mentioned in this document.
A pre-relational databases datamodel. "Preceeded" by the relational model since the flexibility of this makes it hard to work with. Now re-invented in RDF :)
Walrus is a tool for interactively visualizing large directed graphs in three-dimensional space. By employing a fisheye-like distortion, it provides a display that simultaneously shows local detail and the global context.
P. Heim, J. Ziegler, und S. Lohmann. Proceedings of the International Workshop on Interacting with Multimedia Content in the Social Semantic Web (IMC-SSW 2008), Volume 417 von CEUR Workshop Proceedings, Seite 49--58. Aachen, (2008)
D. Peng, A. Wolff, und J. Haunert. Proc. 28th Int. Cartogr. Conf. (ICC'17) -- Advances
in Cartogr. & GIScience, Seite 389--404. Springer-Verlag, (2017)
D. Yang, P. Rosso, B. Li, und P. Cudre-Mauroux. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Seite 1162–1172. New York, NY, USA, Association for Computing Machinery, (2019)
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, und Y. Shen. Advances in Neural Information Processing Systems, 33, Seite 5812--5823. Curran Associates, Inc., (2020)