Two-phase Flow Algorithms
Two-Phase Flow Algorithms is a network flow algorithm that belongs to the class of methods designed for solving maximum flow problems, distinguished by its systematic separation of the flow computation into two distinct stages—first establishing a feasible flow and then augmenting it to optimality—thereby improving efficiency and correctness in specific flow network scenarios.
99
Publications
12.3K
Citations
271
Authors
135
Institutions
Publications per year
2017–2026
21
Parents
99
An improved level set method for incompressible two-phase flows
Mark Sussman, Emad Fatemi, Peter Smereka et al. · Computers & Fluids · 1998 · 812 citations
Engineering, Computational Engineering, Mechanical Engineering +9
1–5 of 99
271
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 271
135

Xi'an Jiaotong University
Xi'an, China
3 h-index
9 publications
213 citations
University of Brighton
Brighton, United Kingdom
2 h-index
4 publications
103 citations

Shanghai Jiao Tong University
Shanghai, China
2 h-index
7 publications
398 citations
Commissariat à l'Énergie Atomique et aux Énergies Alternatives
Paris, France
2 h-index
4 publications
52 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
197 citations
Stanford University
Stanford, United States
2 h-index
4 publications
292 citations

Helmholtz-Zentrum Dresden-Rossendorf
Dresden, Germany
2 h-index
5 publications
270 citations

Kyoto University
Kyoto, Japan
2 h-index
3 publications
303 citations
1–8 of 135
24 publications · 7.5K citations
22
h-index
7 publications · 603 citations
7
h-index
6 publications · 1K citations
6
h-index
4 publications · 93 citations
4
h-index
4 publications · 243 citations
4
h-index
1–5