3958 search results - page 82 / 792 » Dynamic Graph Algorithms with Applications |
129
click to vote
CODES
2006
IEEE
15 years 11 months ago
2006
IEEE
Embedded system synthesis, multiprocessor synthesis, and thread assignment policy design all require detailed knowledge of the runtime communication patterns among different threa...
174
click to vote
HCW
1998
IEEE
15 years 9 months ago
1998
IEEE
A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks ...
135
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
179
click to vote
CVPR
2009
IEEE
17 years 4 days ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
118
click to vote
ACSC
2010
IEEE
14 years 12 months ago
2010
IEEE
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...