559 search results - page 28 / 112 » Augmented Marked Graphs |
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
GG
2010
Springer
13 years 9 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
ESA
2006
Springer
14 years 16 days ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
GD
1998
Springer
14 years 1 months ago
1998
Springer
This report proposes a