<epdcx:descriptionSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:epdcx="http://purl.org/eprint/epdcx/2006-11-16/" xsi:schemaLocation="http://purl.org/eprint/epdcx/2006-11-16/ http://purl.org/eprint/epdcx/xsd/2006-11-16/epdcx.xsd">
  <epdcx:description epdcx:resourceURI="http://gdea.informatik.uni-koeln.de/793/">
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/1.1/type" epdcx:valueURI="http://purl.org/eprint/entitType/ScholarlyWork"></epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/1.1/identifier">
      <epdcx:valueString epdcx:sesURI="http://purl.org/dc/terms/URI">http://gdea.informatik.uni-koeln.de/793/</epdcx:valueString>
    </epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/eprint/terms/isExpressedAs" epdcx:valueRef="expression_793_1"></epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/1.1/title">
      <epdcx:valueString>Drawing Bipartite Graphs on Two Curves</epdcx:valueString>
    </epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/dc/terms/abstract">
      <epdcx:valueString>Let G be a bipartite graph, and let $\lambda_e,\lambda_i$ be two&#13;
parallel convex curves; we study the question about whether G&#13;
admits a planar straight line drawing such that the vertices of&#13;
one partite set of G lie on $\lambda_e$ and the vertices of the&#13;
other partite set lie on $\lambda_i$. A characterization is&#13;
presented that gives rise to linear time testing and drawing&#13;
algorithms.</epdcx:valueString>
    </epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/dc/elements/1.1/creator">Di Giacomo, Emilio</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/dc/elements/1.1/creator">Grilli, Luca</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/dc/elements/1.1/creator">Liotta, Giuseppe</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/1.1/subject">
      <epdcx:valueString>P.300</epdcx:valueString>
    </epdcx:statement>
  </epdcx:description>
  <epdcx:description epdcx:resourceId="expression_793_1">
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/elements/1.1/title">
      <epdcx:valueString>Drawing Bipartite Graphs on Two Curves</epdcx:valueString>
    </epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/terms/available">2007-05-04</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/dc/terms/bibliographicCitation">Di Giacomo, Emilio and Grilli, Luca and Liotta, Giuseppe (2007) Drawing Bipartite Graphs on Two Curves. [Conference Paper]</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://www.loc.gov/loc.terms/relators/EDT">Kaufmann, Michael</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://www.loc.gov/loc.terms/relators/EDT">Wagner, Dorothea</epdcx:statement>
    <epdcx:statement epdcx:propertyURI="http://purl.org/eprint/terms/status" epdcx:valueURI="http://purl.org/eprint/status/NonPeerReviewed"></epdcx:statement>
  </epdcx:description>
</epdcx:descriptionSet>