Sciweavers

1274 search results - page 43 / 255
» Graph lambda theories
Sort
View
JUCS
2007
105views more  JUCS 2007»
13 years 8 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
FASE
2005
Springer
14 years 2 months ago
Ensuring Structural Constraints in Graph-Based Models with Type Inheritance
Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entitie...
Gabriele Taentzer, Arend Rensink
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 9 months ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 9 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira