523 search results - page 81 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
160
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
182
click to vote
SPAA
1999
ACM
15 years 9 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 ...
152
Voted
EVOW
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
125
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
160
click to vote
CIE
2007
Springer
15 years 11 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....