8 citations · 8 across the 5 of their papers we have counts for
8 papers
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms
Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu
We study the epidemic source detection problem in contact tracing networks modeled as a graph-constrained maximum likelihood estimation problem using the susceptible-infected model…
Total Colorings of Some Classes of FourRegular Circulant Graphs
R. Navaneeth, J. Geetha, K. Somasundaram +1
The total chromatic number, is the minimum number of colors which need to be assigned to obtain a total coloring of the graph . The Total Coloring Conjecture (TCC) made…
Strongly separable matrices for nonadaptive combinatorial group testing
Jinping Fan, Hung-Lin Fu, Yujie Gu +2
In nonadaptive combinatorial group testing (CGT), it is desirable to identify a small set of up to defectives from a large population of items with as few tests (i.e. large…
Beyond Hamiltonicity of Prime Difference Graphs
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph , which w…
On the integer {k}-domination number of circulant graphs
Yen-Jen Cheng, Hung-Lin Fu, Chia-an Liu
Let be a simple undirected graph. is a circulant graph defined on with difference set provided…
From a Consequence of Bertrand's Postulate to Hamilton Cycles
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers can be partitioned into pairs so tha…