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...
148
Voted
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...
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 ...
132
click to vote
COCOON
15 years 10 months ago
2005 Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
180
click to vote
COCOON
15 years 10 months ago
2005 Springer 
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
|
Combinatorics