Sciweavers

219 search results - page 14 / 44
» Maximum common subgraph: some upper bound and lower bound re...
Sort
View
89
Voted
DM
2002
116views more  DM 2002»
14 years 9 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
ASIACRYPT
2000
Springer
15 years 1 months ago
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
In this paper we introduce a structure iterated by the rule A of Skipjack and show that this structure is provably resistant against differential or linear attacks. It is the main ...
Jaechul Sung, Sangjin Lee, Jong In Lim, Seokhie Ho...
155
Voted
TON
2010
192views more  TON 2010»
14 years 4 months ago
Delay analysis for wireless networks with single hop traffic and general interference constraints
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
Gagan Raj Gupta, Ness B. Shroff
WIOPT
2010
IEEE
14 years 7 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
12 years 12 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...