In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...
We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function--proving a conjecture of Guttmann [Discrete Math. 217 (2000) 167
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...