Treewidth computations II. Lower bounds

Hans L. Bodlaender, Arie M.C.A. Koster
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
Lower bounds give indications of the quality of treewidth upper bounds and upper bound algorithms. • Better lower bounds can make preprocessing more effective. There are preprocessing rules that apply only when a large enough lower bound on the treewidth of the graph is known.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2011.04.003">doi:10.1016/j.ic.2011.04.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tndpvxgrv5d6par5f7mib3ft24">fatcat:tndpvxgrv5d6par5f7mib3ft24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414115216/https://core.ac.uk/download/pdf/81960671.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> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c6/e5/c6e5817d232b4e844e33c503ec25ad6d62448c88.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2011.04.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>