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...
— The science of physics is based on theories and models as well as experiments: the former structure relations and simplify reality to a degree such that predictions on physical...
Sabina Jeschke, Harald Scheel, Thomas Richter, Chr...
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
The impossibility of current spatial database systems and GIS to handle spatial vagueness and imprecision has been recognized as an important problem in the spatial database domai...