Sciweavers

2487 search results - page 170 / 498
» Partitions of Graphs into Trees
Sort
View
134
Voted
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 7 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
137
Voted
BMCBI
2006
114views more  BMCBI 2006»
15 years 3 months ago
Taxonomic colouring of phylogenetic trees of protein sequences
Background: Phylogenetic analyses of protein families are used to define the evolutionary relationships between homologous proteins. The interpretation of protein-sequence phyloge...
Gareth Palidwor, Emmanuel G. Reynaud, Miguel A. An...
137
Voted
GD
2005
Springer
15 years 9 months ago
Drawing Graphs Using Modular Decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Charis Papadopoulos, Constantinos Voglis
160
Voted
POPL
1993
ACM
15 years 7 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
119
Voted
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 3 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...