1201 search results - page 111 / 241 » On the cardinality of fuzzy sets |
159
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
186
click to vote
JGT
2008
15 years 6 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
164
click to vote
APPML
2011
15 years 1 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
161
click to vote
WCE
2007
15 years 7 months ago
2007
— Agents are being recommended as a next generation model for revising and restructuring the complex distributed applications. So the task of engineering quality for agent system...
144
click to vote
IJIS
2002
15 years 6 months ago
2002
In search of semantic richer and more flexible database modelling and database querying techniques, different approaches based on fuzzy set theory have been developed. Among the m...