1545 search results - page 32 / 309 » On tree congestion of graphs |
DAM
2010
14 years 9 months ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
111
click to vote
IPL
2008
14 years 9 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
PPL
2002
14 years 9 months ago
2002
The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failu...
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
GC
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...