We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...