3958 search results - page 25 / 792 » Dynamic Graph Algorithms with Applications |
127
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
114
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
122
click to vote
GD
2006
Springer
15 years 6 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
119
click to vote
ISCI
2007
15 years 2 months ago
2007
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
114
click to vote
FCCM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...