default search action
Haixing Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j52]Liang Wei
, Faxu Li, Haixing Zhao, Bo Deng:
On the minimum driver node set of k-uniform linear hypertree networks. Appl. Math. Comput. 474: 128702 (2024) - [j51]Jing Liang, Haixing Zhao, Sun Xie:
A Method for Calculating the Reliability of 2-Separable Networks and Its Applications. Axioms 13(7): 459 (2024) - [j50]Mingyuan Li, Lei Meng, Zhonglin Ye, Yanglin Yang, Shujuan Cao, Yuzhi Xiao, Haixing Zhao:
TP-GCL: graph contrastive learning from the tensor perspective. Frontiers Neurorobotics 18 (2024) - [j49]Zhonglin Ye, Yanlong Tang, Haixing Zhao, Zhaoyang Wang, Ying Ji:
Multi-channel high-order network representation learning research. Frontiers Neurorobotics 18 (2024) - [j48]Zhonglin Ye, Zhuoran Li, Gege Li, Haixing Zhao:
Dual-channel deep graph convolutional neural networks. Frontiers Artif. Intell. 7 (2024) - [j47]Lei Meng, Zhonglin Ye, Yanlin Yang, Haixing Zhao
DeepMCGCN: Multi-channel Deep Graph Neural Networks. Int. J. Comput. Intell. Syst. 17(1): 41 (2024) - [j46]Mingyuan Li, Lei Meng, Zhonglin Ye, Yanlin Yang, Shujuan Cao
GSGSL: Gravity-driven self-supervised graph structure learning. Inf. Process. Manag. 61(4): 103744 (2024) - [j45]Mingyuan Li, Lei Meng, Zhonglin Ye, Yuzhi Xiao, Shujuan Cao
Line graph contrastive learning for node classification. J. King Saud Univ. Comput. Inf. Sci. 36(4): 102011 (2024) - [j44]Yadang Chen
Boosting Video Object Segmentation via Robust and Efficient Memory Network. IEEE Trans. Circuits Syst. Video Technol. 34(5): 3340-3352 (2024) - [j43]Le Sun
MASSFormer: Memory-Augmented Spectral-Spatial Transformer for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote. Sens. 62: 1-15 (2024) - 2023
- [j42]Yanlin Yang, Zhonglin Ye, Haixing Zhao
A Novel Link Prediction Framework Based on Gravitational Field. Data Sci. Eng. 8(1): 47-60 (2023) - [j41]Shujuan Cao, Xiaoming Wang, Zhonglin Ye, Mingyuan Li, Haixing Zhao:
LGNN: a novel linear graph neural network algorithm. Frontiers Comput. Neurosci. 17 (2023) - [j40]Yanlin Yang, Zhonglin Ye, Haixing Zhao
A Graph Representation Learning Framework Predicting Potential Multivariate Interactions. Int. J. Comput. Intell. Syst. 16(1): 144 (2023) - [j39]Zhonglin Ye, Yanlin Yang, Lei Meng, Gege Li, Zhaoyang Wang, Haixing Zhao:
Applications of Teaching Based on Virtual Reality in Agro-Pastoralism Areas. Int. J. Inf. Commun. Technol. Educ. 19(1): 1-18 (2023) - [j38]Yang Chen
Feature-Based Graph Backdoor Attack in the Node Classification Task. Int. J. Intell. Syst. 2023: 1-13 (2023) - [j37]Yanlong Tang
CTNRL: A Novel Network Representation Learning With Three Feature Integrations. Int. J. Data Warehous. Min. 19(2): 1-14 (2023) - [j36]Wei Zhang
TAMNR: a network embedding learning algorithm using text attention mechanism. PeerJ Comput. Sci. 9: e1736 (2023) - [j35]Ning Zhao, Haixing Zhao, Yinkui Li:
A Vulnerability Measure of k-Uniform Linear Hypergraphs. Symmetry 15(6): 1187 (2023) - [j34]Yanlin Yang
GFNC: Unsupervised Link Prediction Based on Gravitational Field and Node Contraction. IEEE Trans. Comput. Soc. Syst. 10(4): 1835-1851 (2023) - [c18]Mingyuan Li, Lei Meng, Zhonglin Ye, Haixing Zhao, Yuzhi Xiao, Shujuan Cao:
Multi-scale Heterogeneous Graph Contrastive Learning*. IEEE Big Data 2023: 4432-4441 - [c17]Yanglin Yang, Zhonglin Ye, Haixing Zhao, Gege Li, Shujuan Cao:
BLR: A Multi-modal Sentiment Analysis Model. ICANN (10) 2023: 466-478 - [c16]Xiaofei Lin, Zhonglin Ye, Haixing Zhao:
Qinghai Embroidery Classification System and Intelligent Classification Research. ICPCSEE (2) 2023: 174-190 - [c15]Gege Li, Lin Zhou, Zhonglin Ye, Haixing Zhao:
Research on Link Prediction Algorithms Based on Multichannel Structure Modelling. ICPCSEE (2) 2023: 269-284 - [i3]Yang Chen, Stjepan Picek, Zhonglin Ye, Zhaoyang Wang, Haixing Zhao:
Momentum Gradient-based Untargeted Attack on Hypergraph Neural Networks. CoRR abs/2310.15656 (2023) - 2022
- [j33]Lusheng Fang, Bo Deng, Haixing Zhao, Xiaoyun Lv:
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs. Axioms 11(1): 3 (2022) - [j32]Lixin Dong, Haixing Zhao, Hong-Jian Lai
Local Optimality of Mixed Reliability for Several Classes of Networks with Fixed Sizes. Axioms 11(3): 91 (2022) - [j31]Jun Yin
Spectral Invariants and Their Application on Spectral Characterization of Graphs. Axioms 11(6): 260 (2022) - [j30]Jun Yin
On Spectral Characterization of Two Classes of Unicycle Graphs. Symmetry 14(6): 1213 (2022) - [j29]Yu Zhu
Hypernetwork Representation Learning with Common Constraints of the Set and Translation. Symmetry 14(8): 1745 (2022) - [j28]Yu Zhu
Hypernetwork Representation Learning Based on Hyperedge Modeling. Symmetry 14(12): 2584 (2022) - [j27]Jing Liang, Haixing Zhao, Jun Yin:
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks. Theor. Comput. Sci. 923: 144-159 (2022) - [c14]Yu Zhu, Haixing Zhao, Jianqiang Huang, Xiaoying Wang:
Hypernetwork Representation Learning With the Transformation Strategy. HP3C 2022: 131-136 - [c13]Yang Chen, Zhonglin Ye, Haixing Zhao, Lei Meng, Zhaoyang Wang, Yanlin Yang:
A practical adversarial attack on Graph Neural Networks by attacking single node structure. HPCC/DSS/SmartCity/DependSys 2022: 143-152 - [c12]Lei Meng, Zhonglin Ye, Haixing Zhao, Yanlin Yang, Yang Chen, Zhaoyang Wang:
Three-Channel Graph Convolutional Network. HPCC/DSS/SmartCity/DependSys 2022: 153-162 - [c11]Xiaoxin Li, Zhonglin Ye, Haixing Zhao, Yanlin Yang:
Linking Prediction Algorithm Integrating with Lower and Higher Order Features. ICBASE 2022: 232-243 - 2021
- [j26]Liang Wei, Faxu Li, Haixing Zhao, Bo Deng:
The controllability of graphs with diameter n-2. Appl. Math. Comput. 407: 126327 (2021) - [j25]Feng Hu, Lin Ma, Xiu-Xiu Zhan, Yinzuo Zhou, Chuang Liu, Haixing Zhao, Zi-Ke Zhang
The aging effect in evolving scientific citation networks. Scientometrics 126(5): 4297-4309 (2021) - [j24]Sun Xie, Haixing Zhao, Jun Yin:
Nonexistence of uniformly most reliable two-terminal graphs. Theor. Comput. Sci. 892: 279-288 (2021) - [i2]Feng Hu, Lin Ma, Xiu-Xiu Zhan, Yinzuo Zhou, Chuang Liu, Haixing Zhao, Zi-Ke Zhang:
The Aging Effect in Evolving Scientific Citation Networks. CoRR abs/2108.00376 (2021) - 2020
- [j23]Stanislav Jendrol'
Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40(1): 51-65 (2020) - [j22]Yu Zhu, Zhonglin Ye, Haixing Zhao, Ke Zhang:
Text-enhanced network representation learning. Frontiers Comput. Sci. 14(6): 146322 (2020) - [c10]Lei Meng, Zhonglin Ye, Haixing Zhao, Yanlin Yang, Fuxiang Ma:
Hypernetwork Model Based on Logistic Regression. Big Data (CCF) 2020: 195-208
2010 – 2019
- 2019
- [j21]Zhonglin Ye, Haixing Zhao, Ke Zhang, Yu Zhu:
Multi-View Network Representation Learning Algorithm Research. Algorithms 12(3): 62 (2019) - [j20]Zhonglin Ye, Haixing Zhao, Ke Zhang, Zhaoyang Wang, Yu Zhu:
Network representation based on the joint learning of three feature views. Big Data Min. Anal. 2(4): 248-260 (2019) - [j19]Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao
On conflict-free connection of graphs. Discret. Appl. Math. 255: 167-182 (2019) - [j18]Zhonglin Ye, Haixing Zhao, Ke Zhang, Yu Zhu:
基于多视图集成的网络表示学习算法 (Network Representation Learning Based on Multi-view Ensemble Algorithm). 计算机科学 46(1): 117-125 (2019) - [j17]Yuzhi Xiao, Haixing Zhao, Yaping Mao
Invulnerability of planar two-tree networks. Theor. Comput. Sci. 767: 16-25 (2019) - [c9]Yanlin Yang, Zhonglin Ye, Haixing Zhao, Lei Meng:
Link Prediction Based on Gravitational Field of Complex Network. DASC/PiCom/DataCom/CyberSciTech 2019: 499-504 - [c8]Zhonglin Ye, Haixing Zhao, Ke Zhang, Yu Zhu, Yuzhi Xiao, Zhaoyang Wang:
Improved DeepWalk Algorithm Based on Preference Random Walk. NLPCC (1) 2019: 265-276 - 2018
- [j16]Zhonglin Ye
Syntactic word embedding based on dependency syntax and polysemous analysis. Frontiers Inf. Technol. Electron. Eng. 19(4): 524-535 (2018) - [c7]Zhonglin Ye, Haixing Zhao, Ke Zhang, Yu Zhu, Yuzhi Xiao:
Text-Associated Max-Margin DeepWalk. Big Data (CCF) 2018: 301-321 - [c6]Yu Zhu, Zhonglin Ye, Haixing Zhao, Ke Zhang:
Network Representation Learning Based on Community and Text Features. CCL 2018: 348-360 - 2017
- [j15]Bo Deng, An Chang, Haixing Zhao:
Spectral determination of a class of tricyclic graphs. Ars Comb. 131: 123-141 (2017) - [j14]Yuzhi Xiao, Haixing Zhao, Zhen Liu, Yaping Mao
Trees with large numbers of subtrees. Int. J. Comput. Math. 94(2): 372-385 (2017) - [j13]Zhao Wang, Yaping Mao, Chengfu Ye, Haixing Zhao:
Super Edge-Connectivity of Strong Product Graphs. J. Interconnect. Networks 17(2): 1750007:1-1750007:14 (2017) - [c5]Bo Deng, Wenjing Li, Xueliang Li, Yaping Mao, Haixing Zhao:
Conflict-Free Connection Numbers of Line Graphs. COCOA (1) 2017: 141-151 - 2016
- [j12]Faxu Li
On the Estrada index of cactus graphs. Discret. Appl. Math. 203: 94-105 (2016) - [j11]Jun Yin, Liming Xiong, Haixing Zhao:
Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles. Graphs Comb. 32(2): 823-833 (2016) - 2015
- [j10]Zhiwei Guo, Haixing Zhao, Yaping Mao:
On the equitable vertex arboricity of complete tripartite graphs. Discret. Math. Algorithms Appl. 7(4): 1550056:1-1550056:22 (2015) - [j9]Zhiwei Guo, Haixing Zhao, Yaping Mao:
The equitable vertex arboricity of complete tripartite graphs. Inf. Process. Lett. 115(12): 977-982 (2015) - 2014
- [i1]Feng Hu, Haixing Zhao, Xiu-Xiu Zhan, Chuang Liu, Zi-Ke Zhang:
Evolution of citation networks with the hypergraph formalism. CoRR abs/1406.0936 (2014) - 2013
- [c4]Yuzhi Xiao, Haixing Zhao:
Counting the number of spanning trees of generalization Farey graph. ICNC 2013: 1778-1782 - 2012
- [c3]Feng Li, Zongben Xu, Haixing Zhao:
On the Average Distance and Wiener Index of Cartesian Product Networks. QLSC 2012 - 2011
- [j8]Feng Li
Some results on the lexicographic product of vertex-transitive graphs. Appl. Math. Lett. 24(11): 1924-1926 (2011) - 2010
- [c2]Haixing Zhao, Zhuma Gao, Jun Yin:
A Method to Find Chromatically Unique Multipartite Graphs. CIS 2010: 629-633
2000 – 2009
- 2009
- [j7]Haixing Zhao, Ruying Liu:
On the minimum real roots of the adjoint polynomial of a graph. Discret. Math. 309(13): 4635-4641 (2009) - [c1]Haixing Zhao, Liang Wei:
Reliability Polynomials of Networks with Vertex Failure. CIS (1) 2009: 268-271 - 2007
- [j6]Haixing Zhao, Xueliang Li, Ruying Liu:
Chromaticity of the Complements of Some Sparse Graphs. Australas. J Comb. 37: 11-20 (2007) - 2005
- [j5]Haixing Zhao, Xueliang Li, Ruying Liu:
On problems and conjectures on adjointly equivalent graphs. Discret. Math. 295(1-3): 203-212 (2005) - 2004
- [j4]Haixing Zhao, Ruying Liu, Xueliang Li, Ligong Wang:
On properties of adjoint polynomials of graphs and their applications. Australas. J Comb. 30: 291-306 (2004) - [j3]Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu:
On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. Discret. Math. 281(1-3): 277-294 (2004) - [j2]Ruying Liu, Haixing Zhao, Chengfu Ye:
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discret. Math. 289(1-3): 175-179 (2004) - [j1]Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye:
The Chromaticity of Certain Complete Multipartite Graphs. Graphs Comb. 20(3): 423-434 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: