An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
To diversify or not to diversify entity summaries on RDF knowledge graphs?
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
The notion of diversity in graphical entity summarisation on semantic knowledge graphs
Journal of Intelligent Information Systems
Hi-index | 0.00 |
We present AGNES --- a novel algorithm for presenting diversified graphical entity summarisations on semantic knowledge graphs. The main idea is to compute the positions of the vertices in radial system of coordinates based on recursive, in-order traversal of the BST spanning tree of the graph. The implementation of the algorithm is compared on real data with other, existing visualisation tools. We also report a successful user evaluation crowdsourcing experiment that indicates superiority of our algorithm over one of the existing competitors.