Results 111 to 113 of about 971 (113)
Some of the next articles are maybe not open access.
Automated model transformation method from BORM to BPMN
, 2015This paper presents an automated model-to-model transformation method between two popular business modelling notations, namely BORMII (Business Object Relation Modelling, second generation) and BPMN (Business Process Modelling Notation).
J. Tuma, Petr Hanzlík
semanticscholar +1 more source
On a property of non-constant 2-partitions of simple cycles
, 2016We consider undirected finite connected graphs without loops and multiple edges. The sets of vertices and edges of a graph G are denoted by V (G) and E(G), respectively. A function f : V (G) → {0, 1} is called a 2-partition of a graph G.
R. Kamalian, S. V. Balikyan
semanticscholar +1 more source
Solution of maximum clique problem by using branch and bound method
, 2014The maximum clique problems have been widely applied in the field of operations research. The maximum clique problem is finding a solution that is often considered difficult, as well as graph coloring problem, traveling salesman, and so forth.
M. Suyudi +4 more
semanticscholar +1 more source