Sciweavers

1206 search results - page 5 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
WG
2005
Springer
14 years 3 months ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul
DATE
1999
IEEE
138views Hardware» more  DATE 1999»
14 years 2 months ago
Codex-dp: Co-design of Communicating Systems Using Dynamic Programming
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
Jui-Ming Chang, Massoud Pedram
ECAI
2000
Springer
14 years 2 months ago
Graph Based Representation of Dynamic Planning
Dynamic planning concerns the planning and execution of actions in a dynamic, real world environment. Its goal is to take into account changes generated by unpredicted events occur...
Pavlos Moraitis, Alexis Tsoukiàs
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 3 months ago
On Dynamic Shortest Paths Problems
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...
Liam Roditty, Uri Zwick