<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="xsl/oai2.xslt"?>
<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-09-22T05:06:05Z</responseDate>
  <request verb="GetRecord" metadataPrefix="xMetaDissPlus" identifier="oai:kobv.de-opus4-uni-passau:44">https://opus4.kobv.de/opus4-uni-passau/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:kobv.de-opus4-uni-passau:44</identifier>
        <datestamp>2025-08-13</datestamp>
        <setSpec>bibliography:false</setSpec>
        <setSpec>doc-type:PhDThesis</setSpec>
        <setSpec>status-type:publishedVersion</setSpec>
        <setSpec>open_access</setSpec>
        <setSpec>ddc</setSpec>
        <setSpec>ddc:004</setSpec>
      </header>
      <metadata>
        <xMetaDiss:xMetaDiss xmlns:xMetaDiss="http://www.d-nb.de/standards/xmetadissplus/" xmlns:cc="http://www.d-nb.de/standards/cc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcmitype="http://purl.org/dc/dcmitype/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:pc="http://www.d-nb.de/standards/pc/" xmlns:urn="http://www.d-nb.de/standards/urn/" xmlns:hdl="http://www.d-nb.de/standards/hdl/" xmlns:doi="http://www.d-nb.de/standards/doi/" xmlns:thesis="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:ddb="http://www.d-nb.de/standards/ddb/" xmlns:dini="http://www.d-nb.de/standards/xmetadissplus/type/" xmlns="http://www.d-nb.de/standards/subject/" xsi:schemaLocation="http://www.d-nb.de/standards/xmetadissplus/ https://d-nb.info/standards/schema/xmetadissplus.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
          <dc:title xsi:type="ddb:titleISO639-2" lang="eng">Crossings in Clustered Level Graphs</dc:title>
          <dc:title xsi:type="ddb:titleISO639-2" lang="ger" ddb:type="translated">Kreuzungen in Cluster-Level-Graphen</dc:title>
          <dc:creator xsi:type="pc:MetaPers">
            <pc:person>
              <pc:name type="nameUsedByThePerson">
                <pc:foreName>Michael</pc:foreName>
                <pc:surName>Forster</pc:surName>
              </pc:name>
            </pc:person>
          </dc:creator>
          <dc:subject xsi:type="xMetaDiss:DDC-SG">004</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Graphenzeichnen</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Azyklischer gerichteter Graph</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Cluster</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Kreuzung</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Minimierung</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Planarer Graph</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Constraint-Erfüllung</dc:subject>
          <dc:subject xsi:type="xMetaDiss:SWD">Kreuzungszahl</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">graph drawing</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">directed acyclic graph</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">cluster</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">crossing</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">minimization</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">planar graph</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">constraint</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">crossing number</dc:subject>
          <dcterms:abstract xsi:type="ddb:contentISO639-2" ddb:type="noScheme" lang="eng">Clustered graphs are an enhanced graph model with a recursive clustering of the vertices according to a given nesting relation. This prime technique for expressing coherence of certain parts of the graph is used in many applications, such as biochemical pathways and UML class diagrams. For directed clustered graphs usually level drawings are used, leading to clustered level graphs. In this thesis we analyze the interrelation of clusters and levels and their influence on edge crossings and cluster/edge crossings.</dcterms:abstract>
          <dcterms:abstract xsi:type="ddb:contentISO639-2" ddb:type="noScheme" lang="ger">Cluster-Graphen sind ein erweitertes Graph-Modell mit einem rekursiven Clustering der Knoten entsprechend einer gegebenen Inklusionsrelation. Diese bedeutende Technik um Zusammengehörigkeit bestimmter Teile des Graphen auszudrücken wird in vielen Anwendungen benutzt, etwa biochemischen Reaktionsnetzen oder UML Klassendiagrammen. Für gerichtete Cluster-Graphen werden üblicherweise Level-Zeichnungen verwendet, was zu Cluster-Level-Graphen führt. Diese Arbeit analysiert den Zusammenhang zwischen Clustern und Level und deren Auswirkungen auf Kantenkreuzungen und Cluster/Kanten-Kreuzungen.</dcterms:abstract>
          <dc:publisher xsi:type="cc:Publisher" type="dcterms:ISO3166">
            <cc:universityOrInstitution>
              <cc:name>Universität Passau</cc:name>
              <cc:place>Passau</cc:place>
            </cc:universityOrInstitution>
            <cc:address cc:Scheme="DIN5008">Innstrasse 29, 94032 Passau</cc:address>
          </dc:publisher>
          <dc:contributor xsi:type="pc:Contributor" type="dcterms:ISO3166" thesis:role="advisor">
            <pc:person>
              <pc:name type="nameUsedByThePerson">
                <pc:foreName>Franz J.</pc:foreName>
                <pc:surName>Brandenburg</pc:surName>
              </pc:name>
              <pc:academicTitle>Prof. Dr.</pc:academicTitle>
            </pc:person>
          </dc:contributor>
          <dcterms:dateAccepted xsi:type="dcterms:W3CDTF">2005-02-04</dcterms:dateAccepted>
          <dcterms:issued xsi:type="dcterms:W3CDTF">2005-02-14</dcterms:issued>
          <dc:type xsi:type="dini:PublType">PhDThesis</dc:type>
          <dc:type xsi:type="dcterms:DCMIType">Text</dc:type>
          <dini:version_driver>publishedVersion</dini:version_driver>
          <dc:identifier xsi:type="urn:nbn">urn:nbn:de:bvb:739-opus-481</dc:identifier>
          <dcterms:medium xsi:type="dcterms:IMT">application/pdf</dcterms:medium>
          <dc:language xsi:type="dcterms:ISO639-2">eng</dc:language>
          <dc:rights>Standardbedingung laut Einverständniserklärung</dc:rights>
          <thesis:degree>
            <thesis:level>thesis.doctoral</thesis:level>
            <thesis:grantor xsi:type="cc:Corporate">
              <cc:universityOrInstitution>
                <cc:name>Universität Passau</cc:name>
                <cc:place>Passau</cc:place>
                <cc:department>
                  <cc:name>Fakultät für Informatik und Mathematik</cc:name>
                </cc:department>
              </cc:universityOrInstitution>
            </thesis:grantor>
          </thesis:degree>
          <ddb:contact ddb:contactID="F6000-0384"/>
          <ddb:fileNumber>1</ddb:fileNumber>
          <ddb:fileProperties ddb:fileName="Dissertation Michael Forster.pdf" ddb:fileSize="2018308" ddb:fileID="file44-0"/>
          <ddb:transfer ddb:type="dcterms:URI">https://opus4.kobv.de/opus4-uni-passau/oai/container/index/docId/44</ddb:transfer>
          <ddb:identifier ddb:type="URL">https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/44</ddb:identifier>
          <ddb:rights ddb:kind="free"/>
        </xMetaDiss:xMetaDiss>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
