License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-15570
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1557/
Go to the corresponding Portal


Healy, Patrick ; Dwyer, Tim

08191 Working Group Report -- Edge Thresholding

pdf-format:
Document 1.pdf (127 KB)


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:DSP:2008:1557,
  author =	{Patrick Healy and Tim Dwyer},
  title =	{08191 Working Group Report -- Edge Thresholding},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  year =	{2008},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  number =	{08191},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1557},
  annote =	{Keywords: Graph drawing, edge thresholding}
}

Keywords: Graph drawing, edge thresholding
Seminar: 08191 - Graph Drawing with Applications to Bioinformatics and Social Sciences
Issue Date: 2008
Date of publication: 22.07.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI