Results 61 to 70 of about 32,353 (214)

On eulerian and regular perfect path double covers of graphs

Discrete Mathematics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyffarth, K., Wang, Chengde
openaire   +1 more source

Semi‐analytical solution for the stability of deep vertical shaft considering time‐dependent rock‐structure interaction

Deep Underground Science and Engineering, EarlyView.
A novel cavity contraction solution and multilayer shaft wall model were developed to analyze deep shaft stability, considering rock viscosity, support structures, and water pressure, with successful validation through a Hulusu Coal Mine case study.
Bin Chen, Pinqiang Mo, Zhao Lu, Lianfei Kuang, Qiang Zhang, Abolfazl Eslami   +5 more
wiley   +1 more source

Analysis of water vapor transport characteristics of the three persistent rainstorm processes in northeastern Sichuan basin

暴雨灾害, 2020
In this paper, the Eulerian method is used to analyze the water vapor transport and its anomalous characteristics in three persistent rainstorms in the northeastern part of the basin in summer.
Xiaorong LI, Qingyun GAO, Shijun FU
doaj   +1 more source

Edge-Disjoint Paths in Eulerian Digraphs

Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Disjoint paths problems are among the most prominent problems in combinatorial optimisation. The edge- as well as the Vertex-Disjoint Paths problem are NP-complete, both on directed and undirected graphs. But on undirected graphs, Robertson and Seymour developed an algorithm for both problems that runs in cubic time for every fixed number ‍p of ...
Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer   +2 more
openaire   +2 more sources

Parameterized Edge Hamiltonicity

, 2014
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al.
AA Bertossi, B Courcelle, B Courcelle, B Courcelle, DG Corneil, ED Demaine, F Gurski, F Gurski, F Harary, FV Fomin, G Chartrand, H-J Lai, HL Bodlaender, I Razgon, J Flum, L Clark, P Dey, P Hliněnỳ, PA Catlin, R Niedermeier, RA Brualdi, RG Downey, S-I Oum, T-H Lai, TH Cormen, W Espelage, Z Ryjácek, Z-H Chen   +27 more
core   +1 more source

Coupled Fluid–Structure–Acoustic Analysis of Flow‐Induced Noise Control Using an Elastic Baffle in a Micro Channel

Energy Science &Engineering, EarlyView.
This research explores how fluid flow, structural movement, and sound interact in an elastic baffle system. Using a numerical approach based on the finite element method, the study analyzes how noise and vibrations change with different baffle configurations. The findings reveal that shortening the baffle by half reduces noise transmission by 9%, while
Tohid Adibi, Seyed Esmail Razavi, Shams Forruque Ahmed, Khashayar Fardnia, Aydin Qheydarpoor, Hammad Alotaibi   +5 more
wiley   +1 more source

Surface impacts and associated mechanisms of a moisture intrusion into the Arctic observed in mid-April 2020 during MOSAiC

Frontiers in Earth Science, 2023
Distinct events of warm and moist air intrusions (WAIs) from mid-latitudes have pronounced impacts on the Arctic climate system. We present a detailed analysis of a record-breaking WAI observed during the MOSAiC expedition in mid-April 2020. By combining
Benjamin Kirbus, Sofie Tiedeck, Andrea Camplani, Jan Chylik, Susanne Crewell, Sandro Dahlke, Kerstin Ebell, Irina Gorodetskaya, Irina Gorodetskaya, Hannes Griesche, Dörthe Handorf, Ines Höschel, Melanie Lauer, Roel Neggers, Janna Rückert, Matthew D. Shupe, Gunnar Spreen, Andreas Walbröl, Manfred Wendisch, Annette Rinke   +19 more
doaj   +1 more source

A general implementation of Eulerian path

, 2015
Implementation report of an Eulerian path function for general graphs.
Edwardo S. Rivera-Hazim, Ortiz-Zuazaga, Humberto   +1 more
openaire   +1 more source

On the digraph of a unitary matrix

, 2003
Given a matrix M of size n, a digraph D on n vertices is said to be the digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is an arc of D.
Grössing Gerhard, Gudder Stanley, Prisner Erich, Simone Severini, Terras Audrey, Tutte W.   +5 more
core   +2 more sources

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák, Félix Moreno Peñarrubia   +1 more
wiley   +1 more source