Sciweavers

30 search results - page 2 / 6
» On graph equivalences preserved under extensions
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 3 months ago
On Graphs and Codes Preserved by Edge Local Complementation
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...
CGF
2010
118views more  CGF 2010»
13 years 3 months ago
The Readability of Path-Preserving Clusterings of Graphs
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...
PAMI
2006
156views more  PAMI 2006»
13 years 3 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
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...
Yefeng Zheng, David S. Doermann
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 3 months ago
On the logical definability of certain graph and poset languages
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...
Pascal Weil
APLAS
2006
ACM
13 years 9 months ago
Using Metadata Transformations to Integrate Class Extensions in an Existing Class Hierarchy
Abstract. Class extensions provide a fine-grained mechanism to define incremental modifications to class-based systems when standard subclassing mechanisms are inappropriate. To...
Markus Lumpe