3757 search results - page 581 / 752 » The overlap number of a graph |
162
click to vote
DAM
2008
15 years 6 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
152
click to vote
AIR
2006
15 years 6 months ago
2006
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
165
click to vote
ENTCS
2008
15 years 6 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
131
click to vote
ARSCOM
2006
15 years 6 months ago
2006
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
157
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...