<ctx:context-object xmlns:xsi="http://www.w3.org/2001/XML" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx" timestamp="2008-09-18T11:08:54Z" xsi:schemaLocation="info:ofi/fmt:xml:xsd:ctx http://www.openurl.info/registry/docs/info:ofi/fmt:xml:xsd:ctx"><ctx:referent><ctx:identifier>info:oai:generic.eprints.org:596</ctx:identifier><ctx:metadata-by-val><ctx:format>info:ofi/fmt:xml:xsd:oai_dc</ctx:format><ctx:metadata><oai_dc:dc 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" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/">
        <dc:title>Building Blocks of Upward Planar Digraphs</dc:title>
        <dc:creator>Healy, Patrick</dc:creator>
        <dc:creator>Lynch, Karol</dc:creator>
        <dc:subject>P.840 Upward</dc:subject>
        <dc:subject>G.770 Planarity Testing</dc:subject>
        <dc:subject>P.540 Planar</dc:subject>
        <dc:description>We show that a digraph is upward planar if and only if its biconnected components have certain properties.&#13;
</dc:description>
        <dc:publisher>Springer</dc:publisher>
        <dc:contributor>Pach, János</dc:contributor>
        <dc:date>2004</dc:date>
        <dc:type>Conference Paper</dc:type>
        <dc:type>NonPeerReviewed</dc:type>
        <dc:identifier>Healy, Patrick and Lynch, Karol (2004) Building Blocks of Upward Planar Digraphs. [Conference Paper]</dc:identifier>
        <dc:relation>http://gdea.informatik.uni-koeln.de/596/</dc:relation></oai_dc:dc></ctx:metadata></ctx:metadata-by-val></ctx:referent></ctx:context-object>