1545 search results - page 33 / 309 » On tree congestion of graphs |
196
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
162
click to vote
IAT
2006
IEEE
16 years 22 days ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
200
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
178
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
218
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Common existing phylogenetic tree visualisation tools are not able to display readable trees with more than a few thousand nodes. These existing methodologies are base...