Sciweavers

3220 search results - page 15 / 644
» Constrained Graph Processes
Sort
View
FASE
2005
Springer
14 years 3 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
GEM
2007
13 years 11 months ago
Searching for Snake-In-The-Box Codes With Evolved Pruning Models
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...
AMC
2008
78views more  AMC 2008»
13 years 10 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 2 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...