The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple ...
Abstract: On the Euclidean domains of classical signal processing, linking of signal samples to underlying coordinate structures is straightforward. While graph adjacency matrices totally define the ...
Abstract: Finite time-vertex graph signals (FTVGS) provide an efficient representation for capturing spatio-temporal correlations across multiple data sources on irregular structures. Although ...
This project includes the constraint programming (CP) models presented in the paper New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem, IJCAI 2023. The vertex ...
This repo lists several instances used in the Graph Coloring Problem (GCP) and the Weighted Vertex Coloring Problem (WVCP), original graph and reduced version. The work about the reduction is related ...
The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback