1963 search results - page 14 / 393 » The Maximum Solution Problem on Graphs |
IPPS
1998
IEEE
14 years 25 days ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
HEURISTICS
2007
13 years 8 months ago
2007
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
CATS
2008
13 years 10 months ago
2008
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
HM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...