Fu-Hsing Wang

Orcid: 0000-0003-3337-5821

According to our database1, Fu-Hsing Wang authored at least 18 papers between 1992 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Independent spanning trees on WK-recursive networks and WK-recursive pyramids.
J. Supercomput., 2022

2020
Linear time algorithms for finding independent spanning trees on pyramid networks.
J. Comb. Optim., 2020

2019
Rainbow Colorings on WK-recursive Pyramids.
Proceedings of the 9th International Conference on Information Communication and Management, 2019

Rainbow Connection Number in Pyramid Networks.
Proceedings of the 11th International Conference on Computer Modeling and Simulation, 2019

2017
Independent Spanning Trees in RTCC-Pyramids.
Comput. J., 2017

2012
A New Subclass of Integer Linear Programming Problems and Its Applications.
IEEE Trans. Computers, 2012

Global defensive alliances of trees and Cartesian product of paths and cycles.
Discret. Appl. Math., 2012

2010
The lower and upper forcing geodetic numbers of complete <i>n</i>-partite graphs, <i>n</i>-dimensional meshes and tori.
Int. J. Comput. Math., 2010

A note on leader election in directed split-stars and directed alternating group graphs.
Int. J. Comput. Math., 2010

2009
Additive tree 2-spanners of permutation graphs.
Int. J. Comput. Math., 2009

Global defensive alliances in star graphs.
Discret. Appl. Math., 2009

2008
An efficient distributed algorithm for canonical labeling on directed split-stars.
Discret. Appl. Math., 2008

2006
The lower and upper forcing geodetic numbers of block-cactus graphs.
Eur. J. Oper. Res., 2006

2005
Minimal feedback vertex sets in directed split-stars.
Networks, 2005

2004
Feedback vertex sets in star graphs.
Inf. Process. Lett., 2004

A Distributed Algorithm for Finding Minimal Feedback Vertex Sets in Directed Split-Stars.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2003
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
J. Parallel Distributed Comput., 2003

1992
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs.
Inf. Process. Lett., 1992


  Loading...