280 search results - page 35 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
Soft errors in logic are emerging as a significant reliability problem for VLSI designs. This paper presents novel circuit optimization techniques to mitigate soft error rates (SE...
105
click to vote
SAT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
ASUNAM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
106
click to vote
EDOC
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
ARSCOM
1998
14 years 11 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...