1605 search results - page 162 / 321 » On Partitional Labelings of Graphs |
134
Voted
ENTCS
2008
15 years 3 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
97
Voted
DCG
2000
15 years 3 months ago
2000
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
92
Voted
IWCIA
2004
Springer
15 years 9 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
132
Voted
SSPR
2004
Springer
15 years 9 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
166
click to vote
ASP
2003
Springer
15 years 8 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...