Sciweavers

288 search results - page 26 / 58
» On the number of maximal independent sets in a graph
Sort
View
EDBT
2006
ACM
120views Database» more  EDBT 2006»
15 years 10 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
13 years 7 days ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
15 years 10 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
TIT
2011
149views more  TIT 2011»
14 years 4 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
INFOCOM
2007
IEEE
15 years 4 months ago
Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar