2026-10-01T19:51:03Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1557 2026-09-29T16:11:32Z ddc:004 open_access

08191 Working Group Report – Edge Thresholding Healy, Patrick Dwyer, Tim Graph drawing edge thresholding 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Patrick Healy and Tim Dwyer 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08191.3 urn:nbn:de:0030-drops-15570 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.3 eng https://creativecommons.org/licenses/by/4.0/legalcode