3220 search results - page 144 / 644 » Constrained Graph Processes |
ENTCS
2008
14 years 10 months ago
2008
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
BPM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workfl...
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
IPL
2010
14 years 7 months ago
2010
Polynomial algorithms are given for the following two problems:
WWW
2007
ACM
15 years 10 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...