1 Ocak 2018 Dergi makalesi Açık Erişim

Russo, Luis M. S.; Teixeira, Andreia Sofia; Francisco, Alexandre P.

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/36093</identifier>
  <creators>
    <creator>
      <creatorName>Russo, Luis M. S.</creatorName>
      <givenName>Luis M. S.</givenName>
      <familyName>Russo</familyName>
      <affiliation>Univ Lisbon, Inst Super Tecn, INESC ID, Ave Rovisco Pais 1, P-1049001 Lisbon, Portugal</affiliation>
    </creator>
    <creator>
      <creatorName>Teixeira, Andreia Sofia</creatorName>
      <givenName>Andreia Sofia</givenName>
      <familyName>Teixeira</familyName>
    </creator>
    <creator>
      <creatorName>Francisco, Alexandre P.</creatorName>
      <givenName>Alexandre P.</givenName>
      <familyName>Francisco</familyName>
    </creator>
  </creators>
  <titles>
    <title>Linking And Cutting Spanning Trees</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2018</publicationYear>
  <dates>
    <date dateType="Issued">2018-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/36093</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.3390/a11040053</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms. For general graphs, experimental results show that the chain converges quickly. This yields an efficient algorithm due to the use of proper fast data structures. To obtain the mixing time of the chain we describe a coupling, which we analyze for cycle graphs and simulate for other graphs.</description>
  </descriptions>
</resource>