Maximal set
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
- 2010
Define the equivalence relation ~ A on the set of recursive functions of one variable byf~Ag if and only iff([x)=g(x) for all but… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
- 2007
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and… (More)
Is this relevant?
2007
2007
- 2007
We focus on L(A), the filter of supersets of A in the structure of the computably enumerable sets under the inclusion relation… (More)
Is this relevant?
2007
2007
- 2007
Given a bounded open subset Ω of Rd and two positive weight functions f and g, the Cheeger sets of Ω are the subdomains C of… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
- VLDB
- 2005
Finding the maximals in a collection of vectors is relevant to many applications. The maximal set is related to the convex hull… (More)
Is this relevant?
1999
1999
- Discrete Mathematics
- 1999
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in nitely many new pairs (s; v). c © 1999… (More)
Is this relevant?
1994
1994
- Australasian J. Combinatorics
- 1994
A collection of edge-disjoint triangle-factors on K3n is called maximal if it cannot be extended by a further triangle-factor. It… (More)
Is this relevant?
1992
1992
- SODA
- 1992
In this paper we consider two related problems: subset testing and finding maximal sets. First, consider a sequence of <italic>n… (More)
Is this relevant?
1991
1991
- Discrete Mathematics
- 1991
Rees, R. and W.D. Wallis, The spectrum of maximal sets of one-factors, Discrete Mathematics 97 (1991) 357-369. A set {e} of… (More)
Is this relevant?
1990
1990
- Australasian J. Combinatorics
- 1990
A set S of edge-disjoint in a Graph G is to be maximal if there no one-factor of G which is edge-disjoint from if the union of… (More)
Is this relevant?