Sciweavers

9532 search results - page 155 / 1907
» Logic, Graphs, and Algorithms
Sort
View
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
15 years 4 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya
LICS
2003
IEEE
15 years 4 months ago
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
Nir Piterman, Moshe Y. Vardi
CAS
2008
118views more  CAS 2008»
14 years 11 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
ENTCS
2006
151views more  ENTCS 2006»
14 years 11 months ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 3 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham