9611 search results - page 133 / 1923 » A Note on Difference Sets |
GC
2008
Springer
13 years 10 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...
JIIS
2006
13 years 10 months ago
2006
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
GC
2007
Springer
13 years 10 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
ICSE
2009
IEEE-ACM
14 years 11 months ago
2009
IEEE-ACM
Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differentl...