Sciweavers

3204 search results - page 576 / 641
» The Alcuin Number of a Graph
Sort
View
96
Voted
AIR
2006
46views more  AIR 2006»
15 years 18 days ago
Spatial inference with geometric proportional analogies
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...
Emma-Claire Mullally, Diarmuid P. O'Donoghue
103
Voted
ENTCS
2008
97views more  ENTCS 2008»
15 years 18 days ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
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...
Karl-Heinz Pennemann
78
Voted
ARSCOM
2006
81views more  ARSCOM 2006»
15 years 18 days ago
A Counting of the minimal realizations of the posets of dimension two
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...
Pierre Ille, Jean-Xavier Rampon
GC
2008
Springer
15 years 18 days ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
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...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
92
Voted
CC
2006
Springer
133views System Software» more  CC 2006»
15 years 18 days ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx