5889 search results - page 259 / 1178 » Graph Layout Problems |
182
click to vote
WICON
2008
15 years 8 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
161
click to vote
IPCO
2004
15 years 8 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
167
click to vote
IJMC
2006
15 years 6 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
179
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
190
click to vote
APAL
2011
15 years 1 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...