Sciweavers

1206 search results - page 87 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
80
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 25 days ago
On Dynamic Breadth-First Search in External-Memory
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...
Ulrich Meyer
ISBRA
2009
Springer
15 years 7 months ago
Querying Protein-Protein Interaction Networks
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...
Guillaume Blin, Florian Sikora, Stéphane Vi...
100
Voted
TBILLC
2007
Springer
15 years 6 months ago
Expressing Belief Flow in Assertion Networks
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...
Sujata Ghosh, Fernando R. Velázquez-Quesada
116
Voted
IROS
2006
IEEE
204views Robotics» more  IROS 2006»
15 years 6 months ago
Distributed Sensing and Prediction of Obstacle Motions for Mobile Robot Motion Planning
— 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...
Thorsten Rennekamp, Kai Homeier, Torsten Kroeger
86
Voted
ACSC
2010
IEEE
14 years 7 months ago
A batch algorithm for maintaining a topological order
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...
David J. Pearce, Paul H. J. Kelly