845 search results - page 76 / 169 » Connecting Many-Sorted Theories |
152
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
143
click to vote
BEHAVIOURIT
2007
15 years 6 months ago
2007
This paper presents a longitudinal study of the course ‘High-tech Entrepreneurship and New Media’. The course design is based on socio-cultural theories of learning and consid...
144
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
138
click to vote
DCG
2006
15 years 6 months ago
2006
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete ...
183
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...