In this work we investigate the refinement propagation process in longest-edge based local refinement algorithms for unstructured meshes of triangles. The conformity neighborhood of a triangle, the set of additional triangles that is needed to be refined to ensure mesh conformity is introduced to define the propagation path. We prove that asymptotically the propagation path extends on average t...

De novo sequencing is an important computational approach to determining the amino acid sequence of a peptide with tandem mass spectrometry (MS/MS). Most of the existing approaches use a graph model to describe a spectrum and the sequencing is performed by computing the longest antisymmetric path in the graph. The task is often computationally intensive since a given MS/MS spectrum often contai...

A connected graph G with order n ≥ 1 is said to be recursively arbitrarily partitionable (R-AP for short) if either it is isomorphic to K1, or for every sequence (n1, ..., np) of positive integers summing up to n there exists a partition (V1, ..., Vp) of V (G) such that each Vi induces a connected R-AP subgraph of G on ni vertices. Since previous investigations, it is believed that a R-AP graph...

In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The arrival processes of the individual parts of the product are independent Poisson processes with equal rates. In each service station, there is a server with exponential distribution of processing time, in which the se...

A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance hypohamiltonian, leaf-stable, and maximally non-hamiltonian graphs. In this paper, we first investigate cubic platypus graphs, covering all orders for which such...

This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV) path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, dou...

Adleman demonstrate that we can deoxyribonucleic acid (DNA) strands to solve an instance of the Hamiltonian path problem (HPP). One year later, Lipton solved another NP hard problem. In this paper, we use this model for developing a new DNA algorithm to solve longest and shortest path with forbidden pairs. Our algorithm works in polynomial time.

We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded during the ILP-based longest path analysis which helps to improve precision. The new analysis works at the assembly level and uses the Omega library to evaluate Presburger formulas.

This paper addresses the problem of accurately computing the delay of a combinational logic circuit in the floating mode of operation. (In this mode the state of the circuit is considered to be unknown when a vector is applied at5 the inputs.) It is well known that using the length of the topologically longest path as an estimate of circuit delay may be pessimistic since this path may be false,...

In this paper we give efficient molecular computing solutions to seven well-known NP-complete problems, namely the Hamiltonian circuit, Path with forbidden pairs, Longest path, Monochromatic triangle, Partition into triangles, Partition into paths of length two, Circuit satisfiability problems in the Parallel filtering model of Amos et al.