524 search results - page 104 / 105 » On the Maximum Number of Cliques in a Graph |
MOBIHOC
2009
ACM
14 years 6 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
ESA
2009
Springer
14 years 23 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ICDAR
2007
IEEE
14 years 15 days ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
SPAA
1999
ACM
13 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
SIROCCO
2010
13 years 7 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...