1729 search results - page 162 / 346 » On Bounds for the k-Partitioning of Graphs |
224
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
125
click to vote
IPL
2006
15 years 6 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
138
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
151
click to vote
ICQNM
2007
IEEE
16 years 24 days ago
2007
IEEE
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
172
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...