Zan-Bo Zhang

Discret. Appl. Math., 2024

Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Convergence and correctness of belief propagation for weighted min-max flow.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

A parallel PageRank algorithm for undirected graph.

[BibT_eX]

[DOI]

Appl. Math. Comput., December, 2023

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.

[BibT_eX]

[DOI]

J. Glob. Optim., November, 2023

A distributed message passing algorithm for computing perfect demand matching.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., September, 2023

Remarks on component factors in K1,r-free graphs.

[BibT_eX]

[DOI]

Guowei Dai

RAIRO Oper. Res., March, 2023

Fine-Tuned Heterogeneous Graph Convolutional Network Embedding.

[BibT_eX]

[DOI]

Sha-Sha Zhang

Ai-Xiang Chen

Proceedings of the International Conference on Machine Learning and Cybernetics, 2023

2022

Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Sufficient conditions for graphs with {P2, P5}-factors.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2022

Randomized selection algorithm for online stochastic unrelated machines scheduling.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

The Hamiltonian properties in K1, r-free split graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Some degree conditions for 𝒫≥k-factor covered graphs.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2021

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

The cubic graphs with finite cyclic vertex connectivity larger than girth.

[BibT_eX]

[DOI]

Jun Liang

Discret. Math., 2021

2020

Approximation algorithm for a generalized Roman domination problem in unit ball graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

k-Ary spanning trees contained in tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

An Improved Algorithm based on KNN and Random Forest.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Computer Science and Application Engineering, 2019

2017

Extremal and Degree Conditions for Path Extendability in Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

A polynomial time algorithm for cyclic vertex connectivity of cubic graphs.

[BibT_eX]

[DOI]

Jun Liang

Int. J. Comput. Math., 2017

2016

On the complexity of edge-colored subgraph partitioning problems in network optimization.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

2014

Triangle strings: Structures for augmentation of vertex-disjoint triangle sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

2013

Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs.

[BibT_eX]

[DOI]

Xuelian Wen

SIAM J. Discret. Math., 2013

2012

Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

2011

M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities.

[BibT_eX]

[DOI]

Xuelian Wen

Discret. Math., 2011

2010

Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.

[BibT_eX]

Ars Comb., 2010

2009

M-alternating Hamilton paths and M-alternating Hamilton cycles.

[BibT_eX]

[DOI]

Yueping Li

Discret. Math., 2009

2008

Notes on factor-critically, extendability and independence number.

[BibT_eX]

Ars Comb., 2008

2007

Equivalence between Extendability and Factor-Criticality.

[BibT_eX]

Tao Wang