Proceedings of the 24th IEEE Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, 2022

A practical adversarial attack on Graph Neural Networks by attacking single node structure.

[BibT_eX]

[DOI]

Yang Chen

Hypernetwork Representation Learning With the Transformation Strategy.

[BibT_eX]

[DOI]

Proceedings of the HP3C 2022: 6th International Conference on High Performance Compilation, 2022

2021

Nonexistence of uniformly most reliable two-terminal graphs.

[BibT_eX]

[DOI]

Sun Xie

Haixing Zhao

Jun Yin

Theor. Comput. Sci., 2021

The aging effect in evolving scientific citation networks.

[BibT_eX]

[DOI]

Scientometrics, 2021

The controllability of graphs with diameter n-2.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Text-enhanced network representation learning.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., 2020

Conflict-free vertex-connections of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Hypernetwork Model Based on Logistic Regression.

[BibT_eX]

[DOI]

Proceedings of the Big Data - 8th CCF Conference, 2020

2019

Invulnerability of planar two-tree networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

基于多视图集成的网络表示学习算法 (Network Representation Learning Based on Multi-view Ensemble Algorithm).

[BibT_eX]

[DOI]

计算机科学, 2019

On conflict-free connection of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Network representation based on the joint learning of three feature views.

[BibT_eX]

[DOI]

Big Data Min. Anal., 2019

Multi-View Network Representation Learning Algorithm Research.

[BibT_eX]

[DOI]

Algorithms, 2019

Improved DeepWalk Algorithm Based on Preference Random Walk.

[BibT_eX]

[DOI]

Proceedings of the Natural Language Processing and Chinese Computing, 2019

Link Prediction Based on Gravitational Field of Complex Network.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Intl Conf on Dependable, 2019

2018

Syntactic word embedding based on dependency syntax and polysemous analysis.

[BibT_eX]

[DOI]

Zhonglin Ye

Haixing Zhao

Frontiers Inf. Technol. Electron. Eng., 2018

Network Representation Learning Based on Community and Text Features.

[BibT_eX]

[DOI]

Proceedings of the Chinese Computational Linguistics and Natural Language Processing Based on Naturally Annotated Big Data, 2018

Text-Associated Max-Margin DeepWalk.

[BibT_eX]

[DOI]

Proceedings of the Big Data - 6th CCF Conference, 2018

2017

Super Edge-Connectivity of Strong Product Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2017

Trees with large numbers of subtrees.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2017

Spectral determination of a class of tricyclic graphs.

[BibT_eX]

Bo Deng

An Chang

Haixing Zhao

Ars Comb., 2017

Conflict-Free Connection Numbers of Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles.

[BibT_eX]

[DOI]

Jun Yin

Liming Xiong

Haixing Zhao

Graphs Comb., 2016

On the Estrada index of cactus graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

The equitable vertex arboricity of complete tripartite graphs.

[BibT_eX]

[DOI]

Zhiwei Guo

Haixing Zhao

Yaping Mao

Inf. Process. Lett., 2015

2014

Evolution of citation networks with the hypergraph formalism.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Counting the number of spanning trees of generalization Farey graph.

[BibT_eX]

[DOI]

Yuzhi Xiao

Haixing Zhao

Proceedings of the Ninth International Conference on Natural Computation, 2013

2012

On the Average Distance and Wiener Index of Cartesian Product Networks.

[BibT_eX]

[DOI]

Feng Li

Zongben Xu

Haixing Zhao

Proceedings of the Quantitative Logic and Soft Computing, 2012

2011

Some results on the lexicographic product of vertex-transitive graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

A Method to Find Chromatically Unique Multipartite Graphs.

[BibT_eX]

[DOI]

Haixing Zhao

Zhuma Gao

Jun Yin

Proceedings of the 2010 International Conference on Computational Intelligence and Security, 2010

2009

On the minimum real roots of the adjoint polynomial of a graph.

[BibT_eX]

[DOI]

Haixing Zhao

Ruying Liu

Discret. Math., 2009

Reliability Polynomials of Networks with Vertex Failure.

[BibT_eX]

[DOI]

Haixing Zhao

Liang Wei

Proceedings of the 2009 International Conference on Computational Intelligence and Security, 2009

2007

Chromaticity of the Complements of Some Sparse Graphs.

[BibT_eX]

[DOI]

Haixing Zhao

Xueliang Li

Ruying Liu

Australas. J Comb., 2007

2005

On problems and conjectures on adjointly equivalent graphs.

[BibT_eX]

[DOI]

Haixing Zhao

Xueliang Li

Ruying Liu

Discret. Math., 2005

2004

The Chromaticity of Certain Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

On the minimum real roots of the -polynomials and chromatic uniqueness of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs.

[BibT_eX]

[DOI]

Ruying Liu

Haixing Zhao

Chengfu Ye

Discret. Math., 2004

On properties of adjoint polynomials of graphs and their applications.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

Haixing Zhao

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...