Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Pathwidth 5 found (33 total)

alternate case: pathwidth

3-dimensional matching (1,468 words) [view diff] exact match in snippet view article find links to article

(2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". IEEE 54th Annual Symposium on Foundations of Computer Science:
Cycle rank (1,211 words) [view diff] exact match in snippet view article find links to article
Hafsteinsson, Hjálmtýr; Kloks, Ton (1995), "Approximating treewidth, pathwidth, frontsize, and shortest elimination tree", Journal of Algorithms, 18
Ron Shamir (1,874 words) [view diff] exact match in snippet view article find links to article
12.8158, doi:10.1006/jagm.1995.1047 Kaplan, Haim; Shamir, Ron (1996), "Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small
Halin graph (2,141 words) [view diff] exact match in snippet view article find links to article
Fedor V.; Thilikos, Dimitrios M. (2006), "A 3-approximation for the pathwidth of Halin graphs", Journal of Discrete Algorithms, 4 (4): 499–510, doi:10
Longest path problem (2,633 words) [view diff] exact match in snippet view article find links to article
traversed by the search, to construct a path decomposition of the graph, with pathwidth d {\displaystyle d} . Apply dynamic programming to this path decomposition