Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhongzhi Zhang
Person information
- affiliation: Fudan University, Shanghai, China
- affiliation: Hunan City University, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Changan Liu, Changjun Fan, Zhongzhi Zhang:
Finding Influencers in Complex Networks: An Effective Deep Reinforcement Learning Approach. Comput. J. 67(2): 463-473 (2024)- [j51]Mingzhe Zhu
, Wanyue Xu, Wei Li, Zhongzhi Zhang, Haibin Kan:
Hitting Times of Random Walks on Edge Corona Product Graphs. Comput. J. 67(2): 485-497 (2024) - [j50]Haisong Xia, Zhongzhi Zhang:
Efficient Approximation of Kemeny's Constant for Large Graphs. Proc. ACM Manag. Data 2(3): 134 (2024) - [j49]Mingzhe Zhu, Liwang Zhu, Huan Li, Wei Li, Zhongzhi Zhang:
Resistance distances in directed graphs: Definitions, properties, and applications. Theor. Comput. Sci. 1009: 114700 (2024) - [j48]Wanyue Xu, Zhongzhi Zhang:
Linear Opinion Dynamics Model With Higher Order Interactions. IEEE Trans. Comput. Soc. Syst. 11(3): 3627-3636 (2024) - [j47]Liwang Zhu, Xiaotian Zhou, Jiahe Tian, Wei Li, Zhongzhi Zhang:
Defending Against Malicious Influence Control in Online Leader-Follower Social Networks. IEEE Trans. Inf. Forensics Secur. 19: 4809-4819 (2024) - [j46]Changan Liu, Xiaotian Zhou, Ahad N. Zehmakan, Zhongzhi Zhang:
A Fast Algorithm for Moderating Critical Nodes via Edge Removal. IEEE Trans. Knowl. Data Eng. 36(4): 1385-1398 (2024) - [c24]Ahad N. Zehmakan, Xiaotian Zhou, Zhongzhi Zhang:
Viral Marketing in Social Networks with Competing Products. AAMAS 2024: 2047-2056 - [c23]Haoxin Sun, Zhongzhi Zhang:
Efficient Computation for Diagonal of Forest Matrix via Variance-Reduced Forest Sampling. WWW 2024: 792-802 - 2023
- [j45]Mingzhe Zhu, Wanyue Xu, Zhongzhi Zhang, Haibin Kan, Guanrong Chen:
Resistance Distances In Simplicial Networks. Comput. J. 66(8): 1922-1935 (2023) - [j44]Mingzhe Zhu, Haoxin Sun, Wei Li, Zhongzhi Zhang:
Modeling spatial networks by contact graphs of disk packings. Theor. Comput. Sci. 973: 114066 (2023) - [j43]Xiaotian Zhou, Haoxin Sun, Wei Li, Zhongzhi Zhang:
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition. Theor. Comput. Sci. 980: 114220 (2023) - [j42]Liwang Zhu, Qi Bao, Zhongzhi Zhang:
Measures and Optimization for Robustness and Vulnerability in Disconnected Networks. IEEE Trans. Inf. Forensics Secur. 18: 3350-3362 (2023) - [j41]Wanyue Xu, Zhongzhi Zhang:
Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time. ACM Trans. Knowl. Discov. Data 17(7): 93:1-93:19 (2023) - [c22]Haoxin Sun, Zhongzhi Zhang:
Opinion Optimization in Directed Social Networks. AAAI 2023: 4623-4632 - [c21]Wanyue Xu, Zhongzhi Zhang:
Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics. CIKM 2023: 2856-2865 - [c20]Xiaotian Zhou, Liwang Zhu, Wei Li, Zhongzhi Zhang:
A Sublinear Time Algorithm for Opinion Optimization in Directed Social Networks via Edge Recommendation. KDD 2023: 3593-3602 - [c19]Xiaotian Zhou, Zhongzhi Zhang:
Opinion Maximization in Social Networks via Leader Selection. WWW 2023: 133-142 - [i49]Zixuan Xie, Yucheng Wang, Wanyue Xu, Liwang Zhu, Wei Li, Zhongzhi Zhang:
Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web. CoRR abs/2301.03230 (2023) - [i48]Liwang Zhu, Zhongzhi Zhang:
A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks. CoRR abs/2301.05466 (2023) - [i47]Mingzhe Zhu, Liwang Zhu, Huan Li, Wei Li, Zhongzhi Zhang:
Resistance Distances in Directed Graphs: Definitions, Properties, and Applications. CoRR abs/2302.04114 (2023) - [i46]Wanyue Xu, Zhongzhi Zhang:
Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time. CoRR abs/2302.06372 (2023) - [i45]Liwang Zhu, Qi Bao, Zhongzhi Zhang:
Measures and Optimization for Robustness and Vulnerability in Disconnected Networks. CoRR abs/2306.08253 (2023) - [i44]Haoxin Sun, Zhongzhi Zhang:
Opinion Optimization in Directed Social Networks. CoRR abs/2306.16847 (2023) - [i43]Wanyue Xu, Zhongzhi Zhang:
Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics. CoRR abs/2308.07008 (2023) - [i42]Changan Liu, Xiaotian Zhou, Ahad N. Zehmakan, Zhongzhi Zhang:
A Fast Algorithm for Moderating Critical Nodes via Edge Removal. CoRR abs/2309.06392 (2023) - [i41]Changan Liu, Changjun Fan, Zhongzhi Zhang:
Finding Influencers in Complex Networks: An Effective Deep Reinforcement Learning Approach. CoRR abs/2309.07153 (2023) - [i40]Xiaotian Zhou, Haoxin Sun, Wei Li, Zhongzhi Zhang:
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition. CoRR abs/2309.17019 (2023) - [i39]Zenan Lu, Wanyue Xu, Zhongzhi Zhang:
Diagonal of Pseudoinverse of Graph Laplacian: Fast Estimation and Exact Results. CoRR abs/2310.05527 (2023) - [i38]Wanyue Xu, Zhongzhi Zhang:
Linear Opinion Dynamics Model with Higher-Order Interactions. CoRR abs/2310.05689 (2023) - [i37]Ahad N. Zehmakan, Xiaotian Zhou, Zhongzhi Zhang:
Viral Marketing in Social Networks with Competing Products. CoRR abs/2312.15819 (2023) - 2022
- [j40]Jiang Che, Wanyue Xu, Xiaotian Zhou, Zhongzhi Zhang, Haibin Kan:
Some Combinatorial Problems in Power-Law Graphs. Comput. J. 65(7): 1679-1691 (2022) - [j39]Yucheng Wang, Yuhao Yi, Wanyue Xu, Zhongzhi Zhang:
Modeling Higher-Order Interactions in Complex Networks by Edge Product of Graphs. Comput. J. 65(9): 2347-2359 (2022) - [j38]Qi Bao, Wanyue Xu, Zhongzhi Zhang:
Benchmark for Discriminating Power of Edge Centrality Metrics. Comput. J. 65(12): 3141-3155 (2022) - [j37]Zuobai Zhang, Wanyue Xu, Yuhao Yi, Zhongzhi Zhang:
Fast Approximation of Coherence for Second-Order Noisy Consensus Networks. IEEE Trans. Cybern. 52(1): 677-686 (2022) - [j36]Wanyue Xu, Bin Wu, Zuobai Zhang, Zhongzhi Zhang, Haibin Kan, Guanrong Chen:
Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks. IEEE Trans. Cybern. 52(7): 5923-5934 (2022) - [j35]Qi Bao, Zhongzhi Zhang:
Discriminating Power of Centrality Measures in Complex Networks. IEEE Trans. Cybern. 52(11): 12583-12593 (2022) - [j34]Yuhao Yi, Bingjia Yang, Zuobai Zhang, Zhongzhi Zhang, Stacy Patterson:
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks. IEEE Trans. Inf. Theory 68(2): 1220-1236 (2022) - [c18]Wanyue Xu, Liwang Zhu, Jiale Guan, Zuobai Zhang, Zhongzhi Zhang:
Effects of Stubbornness on Opinion Dynamics. CIKM 2022: 2321-2330 - [c17]Liwang Zhu, Zhongzhi Zhang:
A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks. KDD 2022: 2648-2656 - [i36]Wanyue Xu, Liwang Zhu, Jiale Guan, Zuobai Zhang, Zhongzhi Zhang:
Effects of Stubbornness on Opinion Dynamics. CoRR abs/2208.04160 (2022) - [i35]Mingzhe Zhu, Wanyue Xu, Wei Li, Zhongzhi Zhang, Haibin Kan:
Hitting Times of Random Walks on Edge Corona Product Graphs. CoRR abs/2212.05744 (2022) - [i34]Mingzhe Zhu, Wanyue Xu, Zhongzhi Zhang, Haibin Kan, Guanrong Chen:
Resistance Distances in Simplicial Networks. CoRR abs/2212.05759 (2022) - 2021
- [j33]Yibo Zeng, Zhongzhi Zhang:
Spectra, Hitting Times and Resistance Distances of q- Subdivision Graphs. Comput. J. 64(1): 76-92 (2021) - [j32]Yi Qi, Wanyue Xu, Liwang Zhu, Zhongzhi Zhang:
Real-World Networks Are Not Always Fast Mixing. Comput. J. 64(2): 236-244 (2021) - [j31]Yuhao Yi, Anirban Das, Bassam Bamieh, Zhongzhi Zhang, Stacy Patterson:
Diffusion and Consensus in a Weakly Coupled Network of Networks. IEEE Trans. Control. Netw. Syst. 8(4): 1601-1612 (2021) - [c16]Zuobai Zhang, Zhongzhi Zhang, Guanrong Chen:
Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal. CIKM 2021: 2657-2667 - [c15]Xiaotian Zhou, Zhongzhi Zhang:
Maximizing Influence of Leaders in Social Networks. KDD 2021: 2400-2408 - [c14]Liwang Zhu, Qi Bao, Zhongzhi Zhang:
Minimizing Polarization and Disagreement in Social Networks via Link Recommendation. NeurIPS 2021: 2072-2084 - [c13]Wanyue Xu, Qi Bao, Zhongzhi Zhang:
Fast Evaluation for Relevant Quantities of Opinion Dynamics. WWW 2021: 2037-2045 - [i33]Wanyue Xu, Qi Bao, Zhongzhi Zhang:
Fast Evaluation for Relevant Quantities of Opinion Dynamics. CoRR abs/2101.08143 (2021) - [i32]Wanyue Xu, Bin Wu, Zuobai Zhang, Zhongzhi Zhang, Haibin Kan, Guanrong Chen:
Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks. CoRR abs/2101.08403 (2021) - [i31]Zuobai Zhang, Wanyue Xu, Zhongzhi Zhang, Guanrong Chen:
Opinion Dynamics Incorporating Higher-Order Interactions. CoRR abs/2102.03569 (2021) - [i30]Jiang Che, Wanyue Xu, Xiaotian Zhou, Zhongzhi Zhang, Haibin Kan:
Some Combinatorial Problems in Power-law Graphs. CoRR abs/2104.00944 (2021) - [i29]Xiaotian Zhou, Zhongzhi Zhang:
Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket. CoRR abs/2106.05808 (2021) - [i28]Xiaotian Zhou, Zhongzhi Zhang:
Maximizing Influence of Leaders in Social Networks. CoRR abs/2106.06128 (2021) - [i27]Qi Bao, Zhongzhi Zhang:
Role Similarity Metric Based on Spanning Rooted Forest. CoRR abs/2110.07872 (2021) - [i26]Run Wang, Xiaotian Zhou, Wei Li, Zhongzhi Zhang:
Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix. CoRR abs/2110.12576 (2021) - 2020
- [j30]Yuan Lin, Zhongzhi Zhang:
Effects of Edge Centrality on Random Walks on Graphs. Comput. J. 63(1): 25-40 (2020) - [j29]Yi Qi, Yuze Dong, Zhongzhi Zhang, Zhang Zhang:
Hitting Times for Random Walks on Sierpiński Graphs and Hierarchical Graphs. Comput. J. 63(9): 1385-1396 (2020) - [j28]Yuhao Yi, Zhongzhi Zhang, Stacy Patterson:
Scale-Free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks. IEEE Trans. Cybern. 50(1): 190-200 (2020) - [j27]Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
Maximizing the Number of Spanning Trees in a Connected Graph. IEEE Trans. Inf. Theory 66(2): 1248-1260 (2020) - [c12]Zuobai Zhang, Wanyue Xu, Zhongzhi Zhang, Guanrong Chen:
Opinion Dynamics Incorporating Higher-Order Interactions. ICDM 2020: 1430-1435 - [c11]Zuobai Zhang, Wanyue Xu, Zhongzhi Zhang:
Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph. WSDM 2020: 726-734 - [c10]Wanyue Xu, Yibin Sheng, Zuobai Zhang, Haibin Kan, Zhongzhi Zhang:
Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks. WWW 2020: 46-56 - [i25]Yuhao Yi, Anirban Das, Stacy Patterson, Bassam Bamieh, Zhongzhi Zhang:
Diffusion and Consensus in a Weakly Coupled Network of Networks. CoRR abs/2002.06109 (2020) - [i24]Yucheng Wang, Yuhao Yi, Wanyue Xu, Zhongzhi Zhang:
Edge corona product as an approach to modeling complex simplical networks. CoRR abs/2002.12219 (2020)
2010 – 2019
- 2019
- [j26]Yuan Lin, Zhongzhi Zhang:
Non-Backtracking Centrality Based Random Walk on Networks. Comput. J. 62(1): 63-80 (2019) - [j25]Yi Qi, Yuhao Yi, Zhongzhi Zhang:
Topological and Spectral Properties of Small-World Hierarchical Graphs. Comput. J. 62(5): 769-784 (2019) - [j24]Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
A Resistance-Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks. IEEE Trans. Control. Netw. Syst. 6(1): 191-201 (2019) - [j23]Yucheng Wang, Qi Bao, Zhongzhi Zhang:
Combinatorial properties of Farey graphs. Theor. Comput. Sci. 796: 70-89 (2019) - [j22]Yi Qi, Zhongzhi Zhang, Yuhao Yi, Huan Li:
Consensus in Self-Similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. IEEE Trans. Cybern. 49(2): 592-603 (2019) - [j21]Yibin Sheng, Zhongzhi Zhang:
Low-Mean Hitting Time for Random Walks on Heterogeneous Networks. IEEE Trans. Inf. Theory 65(11): 6898-6910 (2019) - [j20]Yi Qi, Zhongzhi Zhang:
Spectral Properties of Extended Sierpiński Graphs and Their Applications. IEEE Trans. Netw. Sci. Eng. 6(3): 512-522 (2019) - [c9]Yujia Jin, Qi Bao, Zhongzhi Zhang:
Forest Distance Closeness Centrality in Disconnected Graphs. ICDM 2019: 339-348 - [c8]Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Current Flow Group Closeness Centrality for Complex Networks? WWW 2019: 961-971 - [i23]Yulun Xu, Qi Bao, Zhongzhi Zhang:
The k-Power Domination Number in Some Self-Similar Graphs. CoRR abs/1911.08045 (2019) - 2018
- [j19]Yi Qi, Huan Li, Zhongzhi Zhang:
Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks. Comput. J. 61(5): 745-760 (2018) - [j18]Liren Shan, Huan Li, Zhongzhi Zhang:
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. Theor. Comput. Sci. 720: 47-54 (2018) - [c7]Yuhao Yi, Bingjia Yang, Zhongzhi Zhang, Stacy Patterson:
Biharmonic Distance and Performance of Second-Order Consensus Networks with Stochastic Disturbances. ACC 2018: 4943-4950 - [c6]Anirban Das, Yuhao Yi, Stacy Patterson, Bassam Bamieh, Zhongzhi Zhang:
Convergence Rate of Consensus in a Network of Networks. CDC 2018: 459-465 - [c5]Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Improving Information Centrality of a Node in Complex Networks by Adding Edges. IJCAI 2018: 3535-3541 - [c4]Yuhao Yi, Liren Shan, Huan Li, Zhongzhi Zhang:
Biharmonic Distance Related Centrality for Edges in Weighted Networks. IJCAI 2018: 3620-3626 - [c3]Huan Li, Zhongzhi Zhang:
Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. SODA 2018: 2377-2396 - [i22]Yuhao Yi, Zhongzhi Zhang, Stacy Patterson:
Scale-free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks. CoRR abs/1801.00535 (2018) - [i21]Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Current Flow Group Closeness Centrality for Complex Networks. CoRR abs/1802.02556 (2018) - [i20]Liren Shan, Huan Li, Zhongzhi Zhang:
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. CoRR abs/1803.00829 (2018) - [i19]Yuan Lin, Zhongzhi Zhang:
Non-Backtracking Centrality Based Random Walk on Networks. CoRR abs/1803.03087 (2018) - [i18]Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
Maximizing the Number of Spanning Trees in a Connected Graph. CoRR abs/1804.02785 (2018) - [i17]Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Improving information centrality of a node in complex networks by adding edges. CoRR abs/1804.06540 (2018) - [i16]Yibo Zeng, Zhongzhi Zhang:
Hitting times and resistance distances of q-triangulation graphs: Accurate results and applications. CoRR abs/1808.01025 (2018) - 2017
- [j17]Weihua Zhan, Jihong Guan, Zhongzhi Zhang:
A New Method for Extracting the Hierarchical Organization of Networks. Int. J. Inf. Technol. Decis. Mak. 16(5): 1359-1386 (2017) - [j16]Qunfeng Liu, Guang Yang, Zhongzhi Zhang, Jinping Zeng:
Improving the convergence rate of the DIRECT global optimization algorithm. J. Glob. Optim. 67(4): 851-872 (2017) - [j15]Huan Li, Zhongzhi Zhang:
Maximum matchings in scale-free networks with identical degree distribution. Theor. Comput. Sci. 675: 64-81 (2017) - [j14]Liren Shan, Huan Li, Zhongzhi Zhang:
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. Theor. Comput. Sci. 677: 12-30 (2017) - [j13]Yujia Jin, Huan Li, Zhongzhi Zhang:
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. Theor. Comput. Sci. 703: 37-54 (2017) - [j12]Yuhao Yi, Zhongzhi Zhang, Liren Shan, Guanrong Chen:
Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network. IEEE Trans. Control. Syst. Technol. 25(1): 342-350 (2017) - [c2]Yuan Lin, Wei Chen, Zhongzhi Zhang:
Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices. WWW 2017: 223-232 - [i15]Liren Shan, Huan Li, Zhongzhi Zhang:
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. CoRR abs/1703.09023 (2017) - [i14]Huan Li, Zhongzhi Zhang:
Maximum matchings in scale-free networks with identical degree distribution. CoRR abs/1703.09041 (2017) - [i13]Zhongzhi Zhang, Huan Li, Yibin Sheng:
Effects of reciprocity on random walks in weighted networks. CoRR abs/1703.09117 (2017) - [i12]Huan Li, Zhongzhi Zhang:
Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. CoRR abs/1708.05959 (2017) - [i11]Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
A Resistance Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks. CoRR abs/1708.06873 (2017) - [i10]Yujia Jin, Huan Li, Zhongzhi Zhang:
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. CoRR abs/1709.04404 (2017) - [i9]Yi Qi, Huan Li, Zhongzhi Zhang:
Extended corona product as an exactly tractable model for weighted heterogeneous networks. CoRR abs/1709.04739 (2017) - [i8]Yi Qi, Zhongzhi Zhang, Yuhao Yi, Huan Li:
Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. CoRR abs/1712.06496 (2017) - 2016
- [j11]Pinchen Xie, Zhongzhi Zhang, Francesc Comellas:
On the spectrum of the normalized Laplacian of iterated triangulations of graphs. Appl. Math. Comput. 273: 1123-1129 (2016) - [j10]Pinchen Xie, Zhongzhi Zhang, Francesc Comellas:
The normalized Laplacian spectrum of subdivisions of a graph. Appl. Math. Comput. 286: 250-256 (2016) - [j9]Zhongzhi Zhang, Shunqi Wu, Mingyun Li, Francesc Comellas:
The number and degree distribution of spanning trees in the Tower of Hanoi graph. Theor. Comput. Sci. 609: 443-455 (2016) - [i7]Yuan Lin, Wei Chen, Zhongzhi Zhang:
Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices. CoRR abs/1610.08217 (2016) - 2015
- [j8]Yuhao Yi, Zhongzhi Zhang, Yuan Lin, Guanrong Chen:
Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network. Comput. J. 58(12): 3242-3254 (2015) - [j7]Zhongzhi Zhang, Bin Wu:
Pfaffian orientations and perfect matchings of scale-free networks. Theor. Comput. Sci. 570: 55-69 (2015) - [i6]Qian Lv, Yuhao Yi, Zhongzhi Zhang:
Corona Graph as a Small-world Model. CoRR abs/1508.03800 (2015) - [i5]Zhongzhi Zhang, Shunqi Wu, Mingyun Li, Francesc Comellas:
The number and degree distribution of spanning trees in the Tower of Hanoi graph. CoRR abs/1510.07949 (2015) - 2014
- [j6]Zhongzhi Zhang, Bin Wu, Francesc Comellas:
The number of spanning trees in Apollonian networks. Discret. Appl. Math. 169: 206-213 (2014) - 2012
- [i4]Zhongzhi Zhang, Bin Wu, Francesc Comellas:
The Number of Spanning Trees in Apollonian Networks. CoRR abs/1210.0090 (2012) - [i3]Francesc Comellas, Alicia Miralles, Hongxiao Liu, Zhongzhi Zhang:
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs. CoRR abs/1210.0092 (2012) - 2011
- [j5]Zhongzhi Zhang, Francesc Comellas:
Farey graphs as models for complex networks. Theor. Comput. Sci. 412(8-10): 865-875 (2011) - 2010
- [i2]Zhongzhi Zhang, Shuyang Gao, Wenlei Xie:
Impact of degree heterogeneity on the behavior of trapping in Koch networks. CoRR abs/1009.0606 (2010) - [i1]Weihua Zhan, Zhongzhi Zhang, Jihong Guan, Shuigeng Zhou:
A evolutionary method for finding communities in bipartite networks. CoRR abs/1011.3315 (2010)
2000 – 2009
- 2009
- [j4]Shuigeng Zhou, Zhongzhi Zhang:
Complex networks and computing. Frontiers Comput. Sci. China 3(3): 322-323 (2009) - 2008
- [c1]Lichao Chen, Francesc Comellas, Zhongzhi Zhang:
Self-similar planar graphs as models for complex networks. IWOCA 2008: 144-154 - 2005
- [j3]Zhongzhi Zhang, Xi-Yan Hu, Lei Zhang:
On the Hermitian-Generalized Hamiltonian Solutions of Linear Matrix Equations. SIAM J. Matrix Anal. Appl. 27(1): 294-303 (2005) - 2004
- [j2]Zhongzhi Zhang, Xi-Yan Hu, Lei Zhang:
Least-squares solutions of inverse problem for hermitian generalized Hamiltonian matrices. Appl. Math. Lett. 17(3): 303-308 (2004) - [j1]Zhongzhi Zhang, Ding-Hua Cao, Jinping Zeng:
Convergence property of a class of variable metric methods. Appl. Math. Lett. 17(4): 437-442 (2004)
Coauthor Index
a service of 
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-07-17 23:12 CEST 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:
