<ctx:context-object xmlns:xsi="http://www.w3.org/2001/XML" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx" timestamp="2008-09-18T11:09:02Z" 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:731</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>On Straightening Low-Diameter Unit Trees</dc:title>
        <dc:creator>Poon, Sheung-Hung</dc:creator>
        <dc:subject>Z.999 Others</dc:subject>
        <dc:description>A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-chain is a chain of k edges. A polygonal tree is a set of edges joined into a tree structure embedded in space. A unit tree is a tree with only edges of unit lenght. A chain or a tree is simple if non-adjacent edges do not intersect. ...</dc:description>
        <dc:contributor>Healy, Patrick</dc:contributor>
        <dc:contributor>Nikolov, Nikola S.</dc:contributor>
        <dc:date>2006</dc:date>
        <dc:type>Conference Poster</dc:type>
        <dc:type>NonPeerReviewed</dc:type>
        <dc:identifier>Poon, Sheung-Hung (2006) On Straightening Low-Diameter Unit Trees. [Conference Poster]</dc:identifier>
        <dc:relation>http://gdea.informatik.uni-koeln.de/731/</dc:relation></oai_dc:dc></ctx:metadata></ctx:metadata-by-val></ctx:referent></ctx:context-object>