We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
In the line of some earlier work done on belief dynamics, we an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth. A modal la...
— This work recommends an architecture and its fundamental components for motion planning for mobile robots in dynamic environments. An adaptive behavior to typical motion patter...
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...