# Yuefang Sun

Orcid: 0000-0002-7515-8481
According to our database

Collaborative distances:

^{1}, Yuefang Sun authored at least 65 papers between 2006 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Appl. Math. Comput., April, 2024

Discret. Appl. Math., March, 2024

Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs.

Discuss. Math. Graph Theory, 2024

Discret. Math., 2024

2023

Theor. Comput. Sci., September, 2023

Discret. Math., August, 2023

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs.

Discret. Math., August, 2023

J. Graph Theory, 2023

2022

J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.

J. Comb. Optim., 2022

Discuss. Math. Graph Theory, 2022

Discret. Math., 2022

Discret. Optim., 2022

CoRR, 2022

CoRR, 2022

CoRR, 2022

A distributed message passing algorithm for the capacitated directed Chinese postman problem.

Comput. Electr. Eng., 2022

2021

J. Interconnect. Networks, 2021

Graphs Comb., 2021

Graphs Comb., 2021

Discuss. Math. Graph Theory, 2021

2020

Research on Intelligent Guidance Optimal Path of Shared Car Charging in the IOT Environment.

Wirel. Commun. Mob. Comput., 2020

Research on safe driving behavior of transportation vehicles based on vehicle network data mining.

Trans. Emerg. Telecommun. Technol., 2020

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs.

Discret. Math., 2020

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

J. Graph Theory, 2019

Convergence and correctness of belief propagation for the Chinese postman problem.

J. Glob. Optim., 2019

Inf. Process. Lett., 2019

Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.

Discret. Math., 2019

CoRR, 2019

Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.

Complex., 2019

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Eur. J. Comb., 2018

Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number.

Discuss. Math. Graph Theory, 2018

Discuss. Math. Graph Theory, 2018

Discret. Math. Algorithms Appl., 2018

CoRR, 2018

CoRR, 2018

Appl. Math. Comput., 2018

2017

J. Interconnect. Networks, 2017

J. Comb. Optim., 2017

J. Comb. Optim., 2017

Discuss. Math. Graph Theory, 2017

Discuss. Math. Graph Theory, 2017

Discuss. Math. Graph Theory, 2017

CoRR, 2017

Appl. Math. Comput., 2017

Appl. Math. Comput., 2017

Layout and Perspective Distortion Independent Recognition of Captured Chinese Document Image.

Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

2016

Discuss. Math. Graph Theory, 2016

2015

Discret. Appl. Math., 2015

2014

Graphs Comb., 2014

Discret. Math. Theor. Comput. Sci., 2014

Note on the generalized connectivity.

Ars Comb., 2014

Australas. J Comb., 2014

Australas. J Comb., 2014

2013

Graphs Comb., 2013

2012

Graphs Comb., 2012

Discret. Math. Theor. Comput. Sci., 2012

2011

CoRR, 2011

Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs.

Ars Comb., 2011

Rainbow connection numbers of line graphs.

Ars Comb., 2011

Australas. J Comb., 2011

2009

CoRR, 2009

2006

Int. J. Inf. Acquis., 2006