139 search results - page 3 / 28 » Bandwidth on AT-Free Graphs |
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
IWPEC
2009
Springer
14 years 26 days 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 ...
CIAC
1997
Springer
13 years 10 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
AINA
2003
IEEE
13 years 11 months ago
2003
IEEE
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
APPROX
2005
Springer
13 years 12 months 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...