Sciweavers

1224 search results - page 151 / 245
» Theory decision by decomposition
Sort
View
87
Voted
DM
2008
96views more  DM 2008»
15 years 25 days ago
Generating 3-vertex connected spanning subgraphs
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...
98
Voted
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 24 days ago
The recognizability of sets of graphs is a robust property
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...
Bruno Courcelle, Pascal Weil
96
Voted
JNS
2008
76views more  JNS 2008»
15 years 22 days ago
Discrete Nonholonomic Lagrangian Systems on Lie Groupoids
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í...
84
Voted
AES
2005
Springer
105views Cryptology» more  AES 2005»
15 years 21 days ago
TH-collocation for the biharmonic equation
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 ...
Martín Díaz, Ismael Herrera
AI
2005
Springer
15 years 21 days ago
SCC-recursiveness: a general schema for argumentation semantics
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...