Sciweavers

2 search results - page 1 / 1
» eig 2008
Sort
View
DAM
2000
97views more  DAM 2000»
13 years 4 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos