Related papers: Partial order alignment by adjacencies and breakpo…
In this paper, we introduce the Dual-minus partial order, get some characterizations of the partial order, and prove that both the dual star partial order and the dual sharp partial order are Dual-minus-type partial orders. Based on the…
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…
The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\geq 3$ to test…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
A poset $\bfp$ is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, $\ell(\bfp)$ of $\bfp$. We prove that if the vertex set $X$ of…
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
Deciding whether a family of disjoint axis-parallel line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan less constrained and the other is to minimize its parallel…
An r-partite graph is an interval r-graph if corresponding to each vertex we can assign an interval of the real line such that two vertices u and v of different partite sets are adjacent if and only if their corresponding intervals…
Partially ordered groups, also known as po-groups, are groups with a compatible partial order. Results from M.I. Zajceva and H.-H. Teh are combined in order to provide a full characterisation of linear order extensions of a given order on a…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
We consider the problem of minimizing a sum of several convex non-smooth functions. We introduce a new algorithm called the selective linearization method, which iteratively linearizes all but one of the functions and employs simple…
This paper describes a new alignment algorithm for sequences that can be used for determination of deletions and substitutions. It provides several solutions out of which the best one can be chosen on the basis of minimization of gaps or…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
The difficulty for solving ill-posed linear operator equations in Hilbert space is reflected by the strength of ill-posedness of the governing operator, and the inherent solution smoothness. In this study we focus on the ill-posedness of…
The paper examines a partial order on bipartite graphs (X1, X2, E) with n vertices, X1UX2={1,2,...,n}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.
Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…
We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner…