<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01657006</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T02:42:57+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Parametrized Analysis of Algorithms on Hierarchical Graphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Rachel</forename>
                <surname>Faran</surname>
              </persName>
              <email type="md5">e96473be049da255a94a7d99768c5b2e</email>
              <email type="domain">cs.huji.ac.il</email>
              <idno type="idhal" notation="numeric">1024586</idno>
              <idno type="halauthorid" notation="string">1275401-1024586</idno>
              <affiliation ref="#struct-102986"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Orna</forename>
                <surname>Kupferman</surname>
              </persName>
              <idno type="halauthorid">541873-0</idno>
              <affiliation ref="#struct-102986"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-12-06 11:44:06</date>
              <date type="whenModified">2017-12-06 13:46:19</date>
              <date type="whenReleased">2017-12-06 13:46:19</date>
              <date type="whenProduced">2017-07-03</date>
              <date type="whenEndEmbargoed">2020-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01657006v1/document">
                <date notBefore="2020-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01657006v1/file/440206_1_En_9_Chapter.pdf" id="file-1657006-1699231">
                <date notBefore="2020-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01657006</idno>
            <idno type="halUri">https://inria.hal.science/hal-01657006</idno>
            <idno type="halBibtex">faran:hal-01657006</idno>
            <idno type="halRefHtml">&lt;i&gt;19th International Conference on Descriptional Complexity of Formal Systems (DCFS)&lt;/i&gt;, Jul 2017, Milano, Italy. pp.114-127, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-60252-3_9"&gt;&amp;#x27E8;10.1007/978-3-319-60252-3_9&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.114-127, &amp;#x27E8;10.1007/978-3-319-60252-3_9&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1657006-1699231"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC1" corresp="IFIP-TC">IFIP TC1: Foundations of Computer Science</idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-DCFS" corresp="IFIP">Descriptional Complexity of Formal Systems</idno>
            <idno type="stamp" n="IFIP-WG1-2" corresp="IFIP-WG">WG 1.2: Descriptional Complexity</idno>
            <idno type="stamp" n="IFIP-LNCS-10316" corresp="IFIP-LNCS">Descriptional Complexity of Formal Systems (DCFS 2017)</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 2: Contributed Papers</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Parametrized Analysis of Algorithms on Hierarchical Graphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Rachel</forename>
                    <surname>Faran</surname>
                  </persName>
                  <email type="md5">e96473be049da255a94a7d99768c5b2e</email>
                  <email type="domain">cs.huji.ac.il</email>
                  <idno type="idhal" notation="numeric">1024586</idno>
                  <idno type="halauthorid" notation="string">1275401-1024586</idno>
                  <affiliation ref="#struct-102986"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Orna</forename>
                    <surname>Kupferman</surname>
                  </persName>
                  <idno type="halauthorid">541873-0</idno>
                  <affiliation ref="#struct-102986"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>19th International Conference on Descriptional Complexity of Formal Systems (DCFS)</title>
                  <date type="start">2017-07-03</date>
                  <date type="end">2017-07-05</date>
                  <settlement>Milano</settlement>
                  <country key="IT">Italy</country>
                </meeting>
                <editor>Giovanni Pighizzini</editor>
                <editor>Cezar Câmpeanu</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Descriptional Complexity of Formal Systems</biblScope>
                  <biblScope unit="volume">LNCS-10316</biblScope>
                  <biblScope unit="pp">114-127</biblScope>
                  <date type="datePub">2017</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-60252-3_9</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Hierarchical graphs are used in order to describe systems with a sequential composition of sub-systems. A hierarchical graph consists of a vector of subgraphs. Vertices in a subgraph may “call” other subgraphs. The reuse of subgraphs, possibly in a nested way, causes hierarchical graphs to be exponentially more succinct than equivalent flat graphs. Early research on hierarchical graphs and the computational price of their succinctness suggests that there is no strong correlation between the complexity of problems when applied to flat graphs and their complexity in the hierarchical setting. That is, the complexity in the hierarchical setting is higher, but all “jumps” in complexity up to an exponential one are exhibited, including no jumps in some problems.We continue the study of the complexity of algorithms for hierarchical graphs, with the following contributions: (1) In many applications, the subgraphs have a small, often a constant, number of exit vertices, namely vertices from which control returns to the calling subgraph. We offer a parameterized analysis of the complexity and point to problems where the complexity becomes lower when the number of exit vertices is bounded by a constant. (2) We describe a general methodology for algorithms on hierarchical graphs. The methodology is based on an iterative compression of subgraphs in a way that maintains the solution to the problems and results in subgraphs whose size depends only on the number of exit vertices, and (3) We handle labeled hierarchical graphs, where edges are labeled by letters from some alphabet, and the problems refer to the languages of the graphs.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.2</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-102986" status="VALID">
          <idno type="ROR">https://ror.org/03qxff017</idno>
          <orgName>The Hebrew University of Jerusalem</orgName>
          <orgName type="acronym">HUJ</orgName>
          <desc>
            <address>
              <addrLine>Jerusalem 91905</addrLine>
              <country key="IL"/>
            </address>
            <ref type="url">http://www.huji.ac.il/huji/eng/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>