4074 search results - page 250 / 815 » Abstract Graph Transformation |
157
click to vote
ICFEM
2000
Springer
15 years 10 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
143
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
179
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
181
click to vote
MICCAI
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
149
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...