License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08191.3
URN: urn:nbn:de:0030-drops-15570
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1557/
|
Go to the corresponding Portal |
Healy, Patrick ;
Dwyer, Tim
08191 Working Group Report -- Edge Thresholding
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.
BibTeX - Entry
@InProceedings{healy_et_al:DagSemProc.08191.3,
author = {Healy, Patrick and Dwyer, Tim},
title = {{08191 Working Group Report – Edge Thresholding}},
booktitle = {Graph Drawing with Applications to Bioinformatics and Social Sciences},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {8191},
editor = {Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2008/1557},
URN = {urn:nbn:de:0030-drops-15570},
doi = {10.4230/DagSemProc.08191.3},
annote = {Keywords: Graph drawing, edge thresholding}
}
|
Keywords: |
|
Graph drawing, edge thresholding |
|
Collection: |
|
08191 - Graph Drawing with Applications to Bioinformatics and Social Sciences |
|
Issue Date: |
|
2008 |
|
Date of publication: |
|
22.07.2008 |
