1736 search results - page 95 / 348 » The rank-width of Directed Graphs |
116
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
136
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
141
click to vote
JGO
2010
15 years 2 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
128
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
123
click to vote
TCBB
2010
15 years 2 months ago
2010
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...