Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Abstract. Class extensions provide a fine-grained mechanism to define incremental modifications to class-based systems when standard subclassing mechanisms are inappropriate. To...