Results 181 to 190 of about 32,353 (214)

An arbitrary lagrangian-eulerian finite element method for path-dependent materials

Computer Methods in Applied Mechanics and Engineering, 1986
The conservation laws, the constitutive equations, and the equation of state for path-dependent materials are formulated for an arbitrary Lagrangian-Eulerian finite element method. Both the geometrical and material nonlinearities are included in this setting. Computer implementations are presented and an elastic-plastic wave propagation problem is used
Liu, Wing Kam, Belytschko, Ted, Chang, Herman   +2 more
openaire   +4 more sources

Two Arc-Disjoint Paths in Eulerian Digraphs

SIAM Journal on Discrete Mathematics, 1995
A polynomial time algorithm is given for the following decision problem: Instance: An Eulerian digraph \(D\) and two pairs \(\{x_1,x_2\},\{y_1,y_2\}\) of its vertices. Question: Is there a choice of \(h,i,j,k\) with \(\{h,i\}=\{j,k\}=\{1,2\}\) such that there are arc-disjoint \(x_hy_j\) and \(x_iy_k\) paths?
Frank, András, Ibaraki, Toshihide, Nagamochi, Hiroshi   +2 more
openaire   +1 more source

Hamiltonian and Eulerian Paths

1983
March 14. Hamiltonian and Eulerian paths and cycles come under the general heading of “de Bruijn sequences”. The specific terms “Hamiltonian” and “Eulerian” are somewhat better known; hence this chapter has been named after them rather than de Bruijn.
George Pólya, Robert E. Tarjan, Donald R. Woods   +2 more
openaire   +1 more source

Eulerian path methods for multiple sequence alignment

Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003, 2004
With the rapid increase in the size of genome sequence databases, the multiple sequence alignment problem is increasingly important and often requires the alignment of a large number of sequences. Beginning in 1975, many heuristic algorithms have been created to improve the speed of computation and the quality of alignment.
M.S. Waterman, Y. Zhang
openaire   +1 more source

On dual Eulerian paths and circuits in plane graphs

1988., IEEE International Symposium on Circuits and Systems, 2003
Given a nonseparable plane graph G, a path or circuit is called dual if it is also a path or circuit, respectively, in the geometric dual of G. Motivated by a layout design problem of CMOS integrated circuits, the authors consider some problems of partitioning the edges of G into the minimum number of dual paths or circuits.
S. Ueno, K. Tsuji, Y. Kajitani
openaire   +1 more source

Enumerating Eulerian Trails via Hamiltonian Path Enumeration

2015
Given an undirected graph G, we consider enumerating all Eulerian trails, that is, walks containing each of the edges in G just once. We consider achieving it with the enumeration of Hamiltonian paths with the zero-suppressed decision diagram (ZDD), a data structure that can efficiently store a family of sets satisfying given conditions.
Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato   +6 more
openaire   +1 more source

The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kawarabayashi, Ken-Ichi, Kobayashi, Yusuke   +1 more
openaire   +2 more sources

A Lagrangian–Eulerian compressible model for the trans-critical path of near-critical fluids

International Journal of Multiphase Flow, 2014
Abstract The main objective of the present work is to model the trans-critical path from supercritical to subcritical states near the critical point. The model is based on full compressible sets of equations. The pressure, temperature and density fields are determined in a Lagrangian form through the divergences of velocity and heat flux and advected
S. Amiroudine, J.-P. Caltagirone, A. Erriguible   +2 more
openaire   +1 more source

An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks

2012
A digraph G = (V,E) with a distinguished set T ⊆ V of terminals is called inner Eulerian if for each v ∈ V − T the numbers of arcs entering and leaving v are equal. By a T-path we mean a simple directed path connecting distinct terminals with all intermediate nodes in V − T. This paper concerns the problem of finding a maximum T-path packing, i.e.
Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov   +2 more
openaire   +1 more source