DagSemProc.08191.3.pdf
- Filesize: 126 kB
- 4 pages
Document
08191 Working Group Report – Edge Thresholding
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8191
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-07-22
Cite AsGet BibTex
Patrick Healy and Tim Dwyer. 08191 Working Group Report – Edge Thresholding. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08191.3
https://doi.org/10.4230/DagSemProc.08191.3
Abstract
When working with very large networks it is
typical for scientists to present a ``thinned out'' version of the
network in order to avoid the clutter of the entire network. For
example in the hypothetical case of illustrating trading patterns
between groups of nations it might be appropriate to limit the inclusion
of inter-nation edges to all those that are significant in terms of
their weight but do not, say, associate with a country outside the
grouping. Arising from a discussion during one of the introductory
sessions we became interested in a problem relating to the discovery of
``key events'' in a network, in terms of an ordered addition of edges to
the network.
Keywords
- Graph drawing
- edge thresholding
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads