3958 search results - page 169 / 792 » Dynamic Graph Algorithms with Applications |
209
click to vote
VLDB
2007
ACM
16 years 16 days ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
159
click to vote
ACSD
2006
IEEE
16 years 15 days ago
2006
IEEE
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
175
click to vote
RSA
2008
15 years 5 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
153
click to vote
DATE
2008
IEEE
16 years 27 days ago
2008
IEEE
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
169
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...