1172 search results - page 93 / 235 » Path Algorithms on Regular Graphs |
94
Voted
GD
2004
Springer
15 years 5 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
138
click to vote
ISCAS
2008
IEEE
15 years 7 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
122
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
85
Voted
EGH
2009
Springer
14 years 10 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
84
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...