The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
—Education of design engineering has started to change in response to the advancement of computer technology. This paper proposes a new design engineering educational framework u...
In a free of charge or flat-rate Internet access environment, there often exists abusive and unfair usage of network resources. In this paper, the Internet access by the dormitory...
Tsung-Ching Lin, Yeali S. Sun, Shi-Chung Chang, Sh...
Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to...
Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Fr...
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...