<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T06:35:51Z</responseDate>
  <request identifier="2154" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2154</identifier>
        <datestamp>2024-03-06T11:08:47Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Comparison of Node-Link and Hierarchical Edge Bundling Layouts: A User Study</dc:title>
          <dc:creator>Telea, Alexandru</dc:creator>
          <dc:creator>Ersoy, Ozan</dc:creator>
          <dc:creator>Hoogendorp, Hessel</dc:creator>
          <dc:creator>Reniers, Dennie</dc:creator>
          <dc:subject>Graph visualization</dc:subject>
          <dc:subject>user studies</dc:subject>
          <dc:subject>software visualization</dc:subject>
          <dc:subject>call graphs</dc:subject>
          <dc:description>Visually investigating large network-like structures is a challenging task.&#13;
Several approaches have been proposed in the past: node-link diagrams,&#13;
adjacency matrices, and, more recently, hierarchical edge bundles. We present a&#13;
recent experiment that compares the effectiveness of the classical node-link diagrams with the more recent hierarchical bundled edges. The users involved several computer science practitioners, the data ranged from graphs of several hundreds to several tens of hundreds of nodes, the tasks involved answering a number of structural overview as well as detailed questions involved system dependencies.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Alexandru Telea and Ozan Ersoy and Hessel Hoogendorp and Dennie Reniers</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9211, Visualization and Monitoring of Network Traffic (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09211.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21542</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09211.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
