Index Terms
- Giving students the competitive edge
Recommendations
Edge connection based Canny edge detection algorithm
Double threshold method of traditional Canny operator detects the edge rely on the information of gradient magnitude, which has a lower edge connectivity and incomplete image information. Aiming at this problem, we proposed an edge detection algorithm ...
Minimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. The chromatic edge strength of a graph is the ...
Edge searching weighted graphs
In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the ...
Comments