3778 search results - page 475 / 756 » Erdos-Ko-Rado for three sets |
165
click to vote
INFSOF
2000
15 years 6 months ago
2000
The paper shows a SHEL oriented requirements engineering approach, which has been applied in a case study dealing with the definition of the requirements for a new railways traffi...
151
click to vote
PC
2000
15 years 6 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
182
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
172
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
172
click to vote
DM
1999
15 years 6 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...