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...
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
This paper studies the construction of geometric integrators for nonholonomic systems. We derive the nonholonomic discrete Euler-Lagrange equations in a setting which permits to de...
David Iglesias, Juan C. Marrero, David Martí...
This paper is intended as a contribution to enhance orthogonal collocation methods. In this, a novel collocation method--TH-collocation--is applied to the biharmonic equation and ...
entation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general r...
Pietro Baroni, Massimiliano Giacomin, Giovanni Gui...