The minimum-cost arborescence problem is a well-studied in the area of graph theory, with known polynomial-time algorithms for solving it. Previous literature introduced new variations on original different objective function and/or constraints. Recently, Precedence-Constrained Minimum-Cost Arborescence was proposed, which precedence constraints are enforced pairs vertices. These prevent format...

Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kept in addition to traditional precedence relations. By the direct precedence between activities A and B we mean that A directly precedes B (no activity is between A and B). We also show how these direct precedence relat...

subject and its attitudes – which precedence and subservience – are the issues of very important in semantics that manifests in different forms such as subject, character and something similar. subject's rank is precedence; because its reason is the first thing comes to mind. different motivations cause subject's precedence which the present study surveys them by expressive – analytic...

A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with parser generators provide different approaches for defining operator precedence. Some generators (e.g. YACC) support precedence declarations, others require the grammar to be unambiguous, thus encoding the precedence rules. Even if the grammar formalism provides preced...

We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence. We propose a consistent definition of strong precedence for chains, trees, and series parallel graphs. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees a...

Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kept additionally to traditional precedence relations (A can directly precede B if no activity must be allocated between A and B). Such precedence relations are motivated by solving problems like modelling sequence-depend...