1206 search results - page 23 / 242 » Arc-Flags in Dynamic Graphs |
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
ICALT
2006
IEEE
14 years 3 months ago
2006
IEEE
This article presents advantages of using context to set up a pedagogical assistance for recognition of collectives situations in Virtual Environment for Training (VET). We are fo...
CIBCB
2008
IEEE
14 years 4 months ago
2008
IEEE
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...