524 search results - page 46 / 105 » On the Maximum Number of Cliques in a Graph |
226
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
157
click to vote
WG
2009
Springer
16 years 21 days ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
164
click to vote
VIZSEC
2005
Springer
15 years 11 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
185
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...