نتایج جستجو برای: eulerian eulerian approach
تعداد نتایج: 1294115 فیلتر نتایج به سال:
A graph G = (V,E) is said to be weakly four-connected if G is 4-edgeconnected and G− x is 2-edge-connected for every x ∈ V . We prove that every weakly four-connected Eulerian graph has a 2-connected Eulerian orientation. This verifies a special case of a conjecture of A. Frank.
In recent years the role of FSI (fluid-structure interaction) simulations in the analysis of the fluid-mechanics of heart valves is becoming more and more important, being able to capture the interaction between the blood and both the surrounding biological tissues and the valve itself. When setting up an FSI simulation, several choices have to be made to select the most suitable approach for t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید