Sciweavers

3702 search results - page 158 / 741
» All Pairings Are in a Group
Sort
View
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 6 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
15 years 6 months ago
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
Catherine S. Greenhill, Andrzej Rucinski
COMGEO
2006
ACM
15 years 6 months ago
A result about the density of iterated line intersections in the plane
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
Christopher J. Hillar, Darren L. Rhea
DM
1998
94views more  DM 1998»
15 years 6 months ago
On embedding complete graphs into hypercubes
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
Michael Klugerman, Alexander Russell, Ravi Sundara...
CSE
2009
IEEE
16 years 1 months ago
A Hybrid Enforcement Model for Group-centric Secure Information Sharing
—Group-Centric Secure Information Sharing (g-SIS) is motivated by the need to dynamically share information amongst a set of authorized users for a specific purpose. Authorized ...
Ram Krishnan, Ravi S. Sandhu