101 search results - page 2 / 21 » To Be and Not To Be: 3-Valued Relations on Graphs |
DMTCS
2010
13 years 2 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
DM
2011
12 years 11 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
DM
2002
13 years 4 months ago
2002
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
ICDAR
2009
IEEE
13 years 11 months ago
2009
IEEE
In this research, we propose CAD data mining technique to obtain semantic elements without prior knowledge about plans being designed. Our method consists of two steps. The first ...