12 search results - page 3 / 3 » Claw-free graphs. III. Circular interval graphs |
DM
2008
13 years 5 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The common utilization-based definition of available bandwidth and many of the existing tools to estimate it suffer from several important weaknesses: i) most tools report a point...