… of T are of two types : the P-nodes and the Q-nodes. We use the general convention of writing
that is to represent P-nodes by circles, and Q-nodes by rectangles. On a P-node, one can …

… In the linear case, these fitting problems are NP-hard for \(\ell_1\)-norm [3] and \(\ell_\infty\)-norm
[8] (no polynomial time algorithm is known for the \(\ell_p\)-norms with \(1\lt p\lt \infty\)) …

… In particular, we show that all copoints of a given point \(p\) define a partition of \(X\setminus
\{ p\}\). In section 4, we investigate the copoint partitions and the compatible orders for flat …

We show in this paper that doubly lexical orders of totally balanced formal context matrices
yield a unique graphical representation binding formal contexts, associated concepts and …

… We will transform P into a path, not longer than P, which has no cut. Let us suppose that P
has at least one cut and that the last cut occurs at G i → G i+1 ; let B = [B 1 B 2 ] be the relevant …

… Let us suppose that it it true for p <n (n > l), and let U = (ZQ, = x, . . . , un-i, u,, = y) be a path of
… p, the subgraph induced by Ni n Np is not strongly connected. Thus, there exist, for every i <p…

… P. P&a, Distance sequences in infinite regular tessellations, Discrete Math. (to appear)…
P. Prka, Distance sequences in Archimedean tilings, F&search Report #19, LIM, (1994). C. …

… We now consider tessellations {p, q}, where p is an even … triangles needs (p - 3) vertices
to be transformed into a p-gon… We now study tessellations {p, q}, where p is an odd integer …

… internal nodes are distinguished as P-nodes or Q-nodes. The children of a P-node can be
… We use the convention that P-nodes are represented by circles or ellipses and Q-nodes are …

… the PQ-tree, using the p-copoints partition and the concept of p-proximity order, also introduced
… from any point p and the copoint partition of p and the p-proximity order introduced in [3]. …