The following pages link to Farong Zhong (Q1799233):
Displaying 12 items.
- The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
- A partition approach to lower bounds for zero-visibility cops and robber (Q2301762) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies (Q3011843) (← links)
- The Buffered π-Calculus: A Model for Concurrent Languages (Q4910463) (← links)
- Actor Petri net Model: toward Suitable and Flexible Level Representation of Scientific Workflows (Q4932654) (← links)
- On the Exact Block Cover Problem (Q5251630) (← links)
- Genomic Scaffold Filling Revisited. (Q5369550) (← links)
- Expected Computations on Color Spanning Sets (Q5405923) (← links)
- Computational and Information Science (Q5491619) (← links)
