A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="http://pdfs.semanticscholar.org/4bc9/37ee1a1ee5624df45925c18398976ec9350d.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Approximating the bandwidth for asteroidal triple-free graphs
[chapter]
<span title="">1995</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
We show that there is an O(n 3 ) algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2. Alternatively, at the cost of the approximation factor, we can also obtain an O(e + nlog n) algorithm to approximate the bandwidth of an AT-free graph within a factor 4 and an O(n + e) algorithm with a factor 6. For the special cases of permutation graphs and trapezoid graphs we obtain O(nlog 2 n) algorithms with worst case performance ratio 2. For cocomparability
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60313-1_161">doi:10.1007/3-540-60313-1_161</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fe3ku6hczfhyvalakh42gx4bzy">fatcat:fe3ku6hczfhyvalakh42gx4bzy</a>
</span>
more »
... hs we obtain an O(n + e) algorithm with worst case performance ratio 3. Finally, we show that there is an O(n 2 log 2 n) algorithm to compute the exact bandwidth of chain graphs. Theorem 2.4 The problem'Given a cobipartite graph G = (V; E) and a positive integer k, decide whether bw(G) k', is NP-complete. Proof. Let G be a cobipartite graph. Then (G) 2 implies that G is claw-free. Hence G is claw-free and AT-free and this implies bw(G) = tw(G) by Theorem 3.12. Finally the problem TREEWIDTH is known to be NP-complete on cobipartite graphs [1] implying that BANDWIDTH on cobipartite graphs is NP-complete. 2 3 Clearly this implies that BANDWIDTH remains NP-complete when restricted to cocomparability graphs or to AT-free graphs. Most of our approximation algorithms are based on the following theorem. Here
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223213538/http://pdfs.semanticscholar.org/4bc9/37ee1a1ee5624df45925c18398976ec9350d.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/4b/c9/4bc937ee1a1ee5624df45925c18398976ec9350d.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60313-1_161">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>