Results 201 to 210 of about 1,569,721 (239)
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks [PDF]
, 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 +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An arbitrary lagrangian-eulerian finite element method for path-dependent materials
Computer Methods in Applied Mechanics and Engineering, 1986The 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
Ted Belytschko +2 more
openaire +3 more sources
Continuous fiber printing path generation based on Euler diagram division
Proceedings of the Institution of mechanical engineers. Part B, journal of engineering manufactureContinuous fiber printed structures are widely used in aerospace applications because of their excellent performance and high design freedom. Existing path planning methods optimize the continuous fiber printing direction by stress lines or discrete ...
Qingyun Bai +4 more
semanticscholar +1 more source
International Journal of Computer Science & Information Technology (IJCSIT)
With the development of social economy, mould processing enterprises have an increasingly strong demand for reducing costs and improving economic efficiency.
Yongheng Shen
semanticscholar +1 more source
With the development of social economy, mould processing enterprises have an increasingly strong demand for reducing costs and improving economic efficiency.
Yongheng Shen
semanticscholar +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, 2010We consider the following well-known problem, which is called the edge-disjoint paths problem.Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2),..., (sk, tk) in G.Output: Edge-disjoint paths P1, P2,..., Pk in G such that Pi joins si and ti for i = 1, 2,..., k.Robertson and Seymour's graph minor project gives rise to ...
Yusuke Kobayashi, Ken-ichi Kawarabayashi
openaire +3 more sources
Research on the Path Planning Method of In-pipe Inspection Robots Based on Graph Theory
2025 2nd International Conference on Intelligent Computing and Robotics (ICICR)The path planning of in-pipeline inspection robots is a critical technology aimed at reducing the energy consumption and time costs associated with robotic inspections.
Yaxun Du, Chenhao Zhao, Qingyu Zou
semanticscholar +1 more source
Reinforcement Learning Based Path Planning for 3D Printed Bio-inspired Voronoi Structures
International Conference on Real-time Computing and RoboticsA bionic flapping-wing robotic aircraft draws inspiration from the flight of insects, leveraging their wing structures known for their exceptional lightweight and high-strength properties.
Xiangyu Wang +3 more
semanticscholar +1 more source
A new continuous printing path planning method for gradient honeycomb infill structures
The International Journal of Advanced Manufacturing Technology, 2023Yamin Li +3 more
semanticscholar +1 more source
An Eulerian Path Approach to Global Multiple Alignment for DNA Sequences
J. Comput. Biol., 2003Yu Zhang, M. Waterman
semanticscholar +1 more source