We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Abstract. We present an approach for modeling and realtime rendering of outdoor scenes, for use in virtual reality applications such as flight simulators and multi-user virtual env...
The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend...
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...