524 search results - page 35 / 105 » On the Maximum Number of Cliques in a Graph |
ATMOS
2010
13 years 6 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
DM
2011
13 years 2 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...
MP
2002
13 years 7 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
COMBINATORICA
2008
13 years 7 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
LCTRTS
2007
Springer
14 years 1 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...