Sciweavers

2487 search results - page 94 / 498
» Partitions of Graphs into Trees
Sort
View
ICALP
2009
Springer
16 years 3 months ago
On Cartesian Trees and Range Minimum Queries
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...
Erik D. Demaine, Gad M. Landau, Oren Weimann
BMCBI
2004
126views more  BMCBI 2004»
15 years 3 months ago
Visualising very large phylogenetic trees in three dimensional hyperbolic space
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...
Timothy Hughes, Young Hyun, David A. Liberles
IPL
2006
87views more  IPL 2006»
15 years 3 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski
102
Voted
EOR
2006
57views more  EOR 2006»
15 years 3 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
ICITA
2005
IEEE
15 years 9 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak