Weizhen Gu

According to our database, Weizhen Gu authored at least 14 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

HIDFlowNet: A Flow-Based Deep Network for Hyperspectral Image Denoising.

Li Pang, Weizhen Gu, Xiangyong Cao, Xiangyu Rui, Jiangjun Peng, Shuang Xu, Gang Yang, Deyu Meng

CoRR, 2023

2022

TRQ3DNet: A 3D Quasi-Recurrent and Transformer Based Network for Hyperspectral Image Denoising.

Li Pang, Weizhen Gu, Xiangyong Cao

Remote. Sens., 2022

2012

On the chromatic numbers of functigraphs.

George Qi, Shenghao Wang, Weizhen Gu

J. Interconnect. Networks, 2012

2009

Bounds on the domination Number of Permutation Graphs.

Weizhen Gu, Kirsti Wash

J. Interconnect. Networks, 2009

2006

On a Network Sensing Problem.

Weizhen Gu, D. Frank Hsu, Xingde Jia

J. Interconnect. Networks, 2006

2005

Chords in graphs.

Weizhen Gu, Xingde Jia, Haidong Wu

Australas. J Comb., 2005

On a Traffic Control Problem.

Weizhen Gu, Xingde Jia

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

1999

On diameter of permutation graphs.

Weizhen Gu

Networks, 1999

Eccentric graphs.

Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters

Networks, 1999

1995

Realization of digraphs by preferences based on distances in graphs.

Weizhen Gu, K. B. Reid, Walter Schnyder

J. Graph Theory, 1995

Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions.

K. B. Reid, Weizhen Gu

Discret. Math., 1995

1993

On minimal embedding of two graphs as center and periphery.

Weizhen Gu

Graphs Comb., 1993

1992

Peripheral and eccentric vertices in graphs.

K. B. Reid, Weizhen Gu

Graphs Comb., 1992

Plurality preference digraphs realized by trees, II: on realization numbers.

K. B. Reid, Weizhen Gu

Discret. Math., 1992