740 search results - page 107 / 148 » Lower bounds for Buchsbaum* complexes |
163
click to vote
MFCS
2007
Springer
16 years 10 days ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
164
click to vote
SOFSEM
2007
Springer
16 years 9 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
145
click to vote
SPIRE
2007
Springer
16 years 9 days ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
190
click to vote
CCECE
2006
IEEE
16 years 7 days ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
165
click to vote
RTCSA
2006
IEEE
16 years 6 days ago
2006
IEEE
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...