4171 search results - page 104 / 835 » Choice numbers of graphs |
152
click to vote
SGAI
2007
Springer
16 years 15 days ago
2007
Springer
A method must be provided to support the analysis of security policy rules interdependencies in a (possibly distributed) environment. We propose a Conceptual Graphs based language...
194
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
166
click to vote
JGAA
2007
15 years 6 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
191
click to vote
IJUFKS
2007
15 years 6 months ago
2007
Abstract. Resampling methods are among the best approaches to determine the number of clusters in prototype-based clustering. The core idea is that with the right choice for the nu...
147
click to vote
DNA
2004
Springer
15 years 11 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...