Sciweavers

106 search results - page 4 / 22
» Dominating direct products of graphs
Sort
View
COMBINATORICA
2007
81views more  COMBINATORICA 2007»
14 years 9 months ago
Total domination of graphs and small transversals of hypergraphs
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
Stéphan Thomassé, Anders Yeo
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
15 years 11 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
86
Voted
ICPP
2000
IEEE
15 years 1 months ago
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
Jie Wu, Hailan Li
101
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 9 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena
CC
2008
Springer
133views System Software» more  CC 2008»
14 years 9 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets