1736 search results - page 112 / 348 » The rank-width of Directed Graphs |
137
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
175
Voted
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
166
click to vote
CPM
1994
Springer
15 years 8 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
164
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
149
click to vote
EJC
2008
15 years 4 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...