1201 search results - page 16 / 241 » Linear Probing and Graphs |
118
Voted
TAMC
2010
Springer
14 years 10 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
104
click to vote
ESCAPE
2007
Springer
15 years 4 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
103
click to vote
SCN
2008
Springer
15 years 10 days ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
117
click to vote
MOBISYS
2004
ACM
16 years 9 hour ago
2004
ACM
The 802.11 IEEE Standard has enabled low cost and effective wireless LAN services (WLAN). With the sales and deployment of WLAN based networks exploding, many people believe that ...
102
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...