2137 search results - page 134 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
158
click to vote
DAM
2000
15 years 4 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
166
click to vote
SPDP
1991
IEEE
15 years 8 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
128
click to vote
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
142
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
138
click to vote
DLOG
2008
15 years 7 months ago
2008
The development of scalable reasoning systems is one of the crucial factors determining the success of Semantic Web systems. Recently, in [GH06], an approach is proposed, which tac...