1512 search results - page 74 / 303 » connection 2006 |
COMBINATORICS
2000
14 years 9 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
JACM
2000
14 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
JCT
2000
14 years 9 months ago
2000
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
MLQ
2000
14 years 9 months ago
2000
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
ORL
2000
14 years 9 months ago
2000
Projected dynamical systems have been introduced by Dupuis and Nagurney as dynamic extensions of variational inequalities. In the systems and control literature, complementarity s...