Now showing items 1-2 of 2
PHILharmonicFlows: research and design methodology
In comprehensive case studies we found out that many limitations of existing Process Management Systems (PrMS) can be traced back to the unsatisfactory integration of processes and data. In the PHILharmonicFlows 1 project, ...
On the largest common subgraph problem
Given two graphs G 1 = <V1, E1> and G 2 = <V2, E2>, |V 1I = IV 2| = n, to determine whether they have a size-k common subgraph is one of the earliest examples of an NP-complete problem (by a trivial reduction from the ...