Results 241 to 250 of about 3,368,549 (267)
GRAPH EQUATIONS FOR LINE GRAPHS, TOTAL GRAPHS AND MIDDLE GRAPHS
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Discrete Mathematics, Algorithms and Applications, 2010
Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into k cones of equal angle, and each point is connected to a nearest neighbor in each cone. The difference between Yao and Theta graphs is in the way the nearest neighbor is defined: Yao graphs minimize the Euclidean distance ...
Damian, Mirela, Raudonis, Kristin
openaire +2 more sources
Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into k cones of equal angle, and each point is connected to a nearest neighbor in each cone. The difference between Yao and Theta graphs is in the way the nearest neighbor is defined: Yao graphs minimize the Euclidean distance ...
Damian, Mirela, Raudonis, Kristin
openaire +2 more sources
Fundamenta Informaticae, 1996
We first give a new definition of graph grammars, which, although following the algebraic double-pushout approach, is more general than the classical one because of the use of a graph of types where all involved graphs are mapped to. Then, we develop a process-based semantics for such (typed) graph grammars, in the line of processes as normally used ...
CORRADINI, ANDREA +2 more
openaire +4 more sources
We first give a new definition of graph grammars, which, although following the algebraic double-pushout approach, is more general than the classical one because of the use of a graph of types where all involved graphs are mapped to. Then, we develop a process-based semantics for such (typed) graph grammars, in the line of processes as normally used ...
CORRADINI, ANDREA +2 more
openaire +4 more sources

