60 search results - page 10 / 12 » combinatorics 1998 |
CPM
1998
Springer
13 years 11 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
CPM
1999
Springer
13 years 11 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
MLQ
1998
13 years 6 months ago
1998
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
COCOON
2005
Springer
14 years 6 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
ECCC
1998
13 years 6 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...