1545 search results - page 72 / 309 » On tree congestion of graphs |
GD
2005
Springer
15 years 3 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
NGC
2000
Springer
15 years 1 months ago
2000
Springer
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
WG
1998
Springer
15 years 2 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
100
click to vote
STACS
2001
Springer
15 years 2 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
TALG
2008
14 years 9 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...