Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees [article]

Joshua Brakensiek, Aaron Potechin
<span title="2013-01-16">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we prove almost tight bounds on the size of sound monotone switching networks accepting permutations sets of directed trees. This roughly corresponds to proving almost tight bounds bounds on the monotone memory efficiency of the directed ST-connectivity problem for the special case in which the input graph is guaranteed to have no path from s to t or be isomorphic to a specific directed tree.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1301.3780v1">arXiv:1301.3780v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/km4jtxll5jetho56bw5t3xskjq">fatcat:km4jtxll5jetho56bw5t3xskjq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1301.3780/1301.3780.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1301.3780v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>