524 search results - page 78 / 105 » On the Maximum Number of Cliques in a Graph |
179
click to vote
APPML
2007
15 years 6 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
190
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
245
click to vote
IPL
2006
15 years 6 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
215
click to vote
MOBICOM
2006
ACM
16 years 21 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
191
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...