1302 search results - page 62 / 261 » On the Strong Chromatic Number |
155
click to vote
FUZZIEEE
2007
IEEE
16 years 22 days ago
2007
IEEE
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
147
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
191
click to vote
CADE
2012
Springer
13 years 8 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
168
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...