Sciweavers

288 search results - page 24 / 58
» On the number of maximal independent sets in a graph
Sort
View
RSA
2010
104views more  RSA 2010»
14 years 8 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
WINE
2007
Springer
126views Economy» more  WINE 2007»
15 years 3 months ago
A Theory of Loss-Leaders: Making Money by Pricing Below Cost
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Cha...
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
15 years 2 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
INFOCOM
2009
IEEE
15 years 4 months ago
Delay Guarantees for Throughput-Optimal Wireless Link Scheduling
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
Koushik Kar, Xiang Luo, Saswati Sarkar
ANOR
2005
160views more  ANOR 2005»
14 years 9 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...