14403 search results - page 43 / 2881 » Dynamical Systems Trees |
CIKM
2008
Springer
13 years 12 months ago
2008
Springer
In many application areas, for example in design or media production processes, several authors have to work cooperatively on the same project. Thereby, a frequently used data for...
WG
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
ICAT
2003
IEEE
14 years 3 months ago
2003
IEEE
Forest resource management systems and forest landscape visualization applications often need usersteered interactive displays of a forest landscape representing the underlying fo...
DISOPT
2006
13 years 10 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...