2137 search results - page 124 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
139
click to vote
DAM
2011
14 years 12 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
151
click to vote
IPL
2002
15 years 4 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
120
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
151
Voted
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
137
click to vote
CSDA
2006
15 years 5 months ago
2006
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...