Sciweavers

803 search results - page 2 / 161
» Independence in Direct-Product Graphs
Sort
View
DM
2007
142views more  DM 2007»
13 years 7 months ago
Dominating direct products of graphs
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
CIDM
2009
IEEE
13 years 11 months ago
Faster computation of the direct product kernel for graph classification
The direct product kernel, introduced by G
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
IPL
2007
74views more  IPL 2007»
13 years 7 months ago
Minimum cycle bases of direct products of complete graphs
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...
Richard Hammack
ECCC
2011
202views ECommerce» more  ECCC 2011»
13 years 2 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 4 months ago
Almost Optimal Bounds for Direct Product Threshold Theorem
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
Charanjit S. Jutla