<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3417</id>
    <completedYear>2011</completedYear>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>14</pageFirst>
    <pageLast>27</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>6637</volume>
    <type>bookpart</type>
    <publisherName>Springer Berlin / Heidelberg</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Latency-Optimal Walks in Replicated and Partitioned Graphs</title>
    <parentTitle language="eng">Database Systems for Adanced Applications</parentTitle>
    <identifier type="doi">10.1007/978-3-642-20244-5_3</identifier>
    <identifier type="url">http://dx.doi.org/10.1007/978-3-642-20244-5{\_}3</identifier>
    <enrichment key="Series">Lecture Notes in Computer Science</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Stefan Plantikow</author>
    <editor>Jianliang Xu</editor>
    <author>Maik Jorra</author>
    <editor>Ge Yu</editor>
    <editor>Shuigeng Zhou</editor>
    <editor>Rainer Unland</editor>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
  </doc>
</export-example>
