3958 search results - page 33 / 792 » Dynamic Graph Algorithms with Applications |
117
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
109
Voted
JGAA
2000
15 years 2 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
100
Voted
WEA
2009
Springer
15 years 9 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
204
click to vote
DIAGRAMS
2008
Springer
15 years 4 months ago
2008
Springer
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs ...
125
click to vote
PPL
2000
15 years 2 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...