2 search results - page 1 / 1 » eig 2008 |
82
Voted
EIG
2008
15 years 5 months ago
2008
117
Voted
DAM
2000
15 years 3 months ago
2000
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;:::...