1816 search results - page 18 / 364 » A New Approach for Solving the Maximum Clique Problem |
DAM
2007
14 years 11 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
106
click to vote
CP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
FUIN
2010
14 years 10 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...