No description
-
November 27, 2014 (v1)PublicationUploaded on: December 4, 2022
-
May 19, 2017 (v1)Publication
We study the application of the continuous wavelet transform to perform signal 1ltering processes. We 1rst show that the convolution and correlation of two wavelet functions satisfy the required admissibility and regularity conditions. By using these new wavelet functions to analyze both convolutions and correlations, respectively, we derive...
Uploaded on: March 27, 2023 -
April 3, 2024 (v1)Publication
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to capture natural constraints of those optimization problems by combining the information provided by two...
Uploaded on: April 4, 2025 -
May 30, 2018 (v1)Publication
No description
Uploaded on: March 27, 2023 -
September 21, 2023 (v1)Publication
In this paper we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between the colours of its vertices. These edge colours are ordered in lexicographical decreasing ordering and...
Uploaded on: October 11, 2023 -
September 14, 2021 (v1)Publication
In this paper,we present the notion of greyscale of a graph, as a colouring of its vertices that uses colours from the continuous spectrum [0, 1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between the colours of its vertices. These edge colours are ordered in lexicographical increasing order...
Uploaded on: March 25, 2023 -
September 14, 2021 (v1)Publication
In this work we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative dif- ference between the colours of its vertices. These edge colours are ordered in lexicographical decreasing ordering and...
Uploaded on: March 25, 2023 -
February 2, 2016 (v1)Publication
A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly embeddable in the grid if it is grid locatable and the segments representing edges do not cross each other. We study the area...
Uploaded on: December 5, 2022