The Orderly Colored Longest Path Problem – a survey of applications and new algorithms

Abstract

A concept of an Orderly Colored Longest Path (OCLP) refers to the problem of finding the longest path in a graph whose edges are colored with a given number of colors, under the constraint that the path follows a predefined order of colors. The problem has not been widely studied in the previous literature, especially for more than two colors in the color arrangement sequence. The recent and relevant application of OCLP is related to the interpretation of Nuclear Magnetic Resonance experiments for RNA molecules. Besides, an employment of this specific graph model can be found in transportation, games, and grid graphs. OCLP models the relationships between consecutive edges of the path, thus it appears very useful in representing the real problems with specific ties between their components. In the paper, we show OCLP's correlation with similar issues known in graph theory. We describe the applications, three alternative models and new integer programming algorithms to solve OCLP. They are formulated by means of max flow problems in a directed graph with packing constraints over certain partitions of nodes. The methods are compared in a computational experiment run for a set of randomly generated instances.

Compatible spanning circuits in edge-colored graphs

“…As a generalization of a properly colored spanning circuit, the main research object in this thesis, i.e., a compatible spanning circuit is of interest in applications of graph theory, for example in genetic and molecular biology [106,112,113], in the design of printed circuit and wiring boards [114], and in channel assignment of wireless networks [3,110].…”

Milp-hyperbox classification for structure-based drug design in the discovery of small molecule inhibitors of SIRTUIN6

“…The distances between the atoms of the molecules are calculated. A survey of the algorithms can be found in [36]. The damping coefficient was set to be 5 ps −1 using Langevin dynamics to handle pressure control.…”

Assigning NMR spectra of irregular RNAs by heuristic algorithms

“…The problem of NOE pathway reconstruction in the NOESY graph has been proven to be strongly NP-hard for regular RNAs [17,27]. It remains computationally intractable also for irregular cases.…”