1518 search results - page 11 / 304 » Exact and Approximate Bandwidth |
TVCG
2012
11 years 9 months ago
2012
— Scientists conducting microarray and other experiments use circular Venn and Euler diagrams to analyze and illustrate their results. As one solution to this problem, this artic...
JCSS
2011
13 years 1 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
APPROX
2005
Springer
14 years 8 days ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...