Frank K. Hwang mainly focuses on Combinatorics, Discrete mathematics, Algorithm, Group testing and Steiner tree problem. His studies in Combinatorics integrate themes in fields like Embedding, Upper and lower bounds and Link. He has included themes like Partition and Regular polygon in his Discrete mathematics study.
His biological study spans a wide range of topics, including Reliability theory, Linear system, Reliability and Line. The concepts of his Group testing study are interwoven with issues in Group tests, Coding, Pooling and Coding theory. His work in the fields of Steiner minimal tree overlaps with other areas such as Range tree.
Combinatorics, Discrete mathematics, Algorithm, Group testing and Computer network are his primary areas of study. His work in Combinatorics is not limited to one particular discipline; it also encompasses Regular polygon. His Steiner tree problem, Disjoint sets and Polytope study in the realm of Discrete mathematics interacts with subjects such as Double loop network.
Algorithm is closely attributed to Pooling in his work. His research is interdisciplinary, bridging the disciplines of Group tests and Group testing. The study incorporates disciplines such as Routing, Sense and Multicast in addition to Clos network.
Frank K. Hwang mostly deals with Combinatorics, Discrete mathematics, Pooling, Algorithm and Theoretical computer science. Frank K. Hwang combines subjects such as Separable space and Combinatorial optimization with his study of Combinatorics. His study in the field of Polytope also crosses realms of Double loop network.
His Pooling research incorporates themes from Upper and lower bounds, Data mining and Transversal. When carried out as part of a general Algorithm research project, his work on Computation is frequently linked to work in Spacetime, therefore connecting diverse disciplines of study. His research on Theoretical computer science also deals with topics like
His main research concerns Combinatorics, Pooling, Group testing, Algorithm and Multistage interconnection networks. His Combinatorics research focuses on Graph theory in particular. Frank K. Hwang works mostly in the field of Pooling, limiting it down to concerns involving Transversal and, occasionally, Algebraic number.
His research integrates issues of Combinatorial optimization and Coding theory in his study of Group testing. His Algorithm research is multidisciplinary, incorporating perspectives in Computational intelligence, Upper and lower bounds, Communications society and Banyan network. His Multistage interconnection networks study integrates concerns from other disciplines, such as Distributed computing and Clos network.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Combinatorial Group Testing and Its Applications
Ding-Zhu Du;Frank Kwang Hwang.
Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing
Ding-Zhu Du;Frank K Hwang.
A Method for Detecting all Defective Members in a Population by Group Testing
F. K. Hwang.
Journal of the American Statistical Association (1972)
Apparatus and method for dynamic resource allocation in wireless communication networks utilizing ordered borrowing
Benvenist Mathilda;Grinberg Albert Gordon;Hwang Frank Kwangming;Liubachevskyi Borys Dmytrovych.
A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
Frank K. Hwang;Shen Lin.
SIAM Journal on Computing (1972)
Reliabilities of Consecutive-k Systems
Gerard J. Chang;Frank Hwang;Lirong Cui.
The rectilinear steiner arborescence problem
Sailesh K. Rao;P. Sadayappan;Frank K. Hwang;Peter W. Shor.
The Mathematical Theory of Nonblocking Switching Networks
Rectilinear steiner trees: Efficient special‐case algorithms
Alfred V. Aho;Michael R. Garey;Frank K. Hwang.
Generalized de Bruijn digraphs
D. Z. Du;F. K. Hwang.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: