This title is part of a longer publication history. The full run of this journal will be searched. TITLE HISTORY A title history is the publication history of a journal and includes a listing of the ...

Abstract: In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. The original FA handles continuous optimization problems only. To ...

zzllrr mather(an offline tool for Math learning, education and research)小乐数学，离线可用的数学学习（自学或教学）、研究辅助工具 ...

Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang, 321004, P. R. China Zhejiang Normal University Xingzhi College, Jinhua, Zhejiang, 321004, P ...

A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems) ...

Department of Mathematics, Zhejiang Normal University, Zhejiang 321004, P. R. China Department of Basics, Zhejiang Guangsha Vocational and Technical, University of Construction, Zhejiang 322100, P. R.

Adjacent vertices are colored dif-ferently from nonadjacent vertices, which are colored the same color. One color is used for a single point, two colors are used for points without a loop, and a ...

A key algorithm that quietly empowers and simplifies our electronics is the Fourier transform, which turns the graph of a signal ... The invention of color TV is a great example of this, Stern ...