179
Voted
COCOON
15 years 6 months ago
2005 Springer 
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
173
click to vote
CPM
15 years 10 months ago
2005 Springer 
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
147
click to vote
COCOON
15 years 10 months ago
2005 Springer 
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
CPM
15 years 10 months ago
2005 Springer  146
click to vote
COCOON
15 years 10 months ago
2005 Springer 
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
|
Combinatorics