250 search results - page 15 / 50 » Constructing a Class of Symmetric Graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
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...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
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 ...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
SEMCO
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...