Results 341 to 350 of about 1,425,497 (376)
Some of the next articles are maybe not open access.
On Strong Edge-Coloring of Claw-Free Subcubic Graphs
Graphs and Combinatorics, 2022Jianbo Lv, Jianxi Li, Xiaoxia Zhang
semanticscholar +1 more source
A generalization of edge‐coloring in graphs
Journal of Graph Theory, 1986AbstractBounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m(ν) times. The known results and proofs generalize in natural ways. Certain new edge‐coloring problems, which have no counterparts when m(ν) = 1 for all ν ϵ V, are studied.
Oded Kariv, S. Louis Hakimi
openaire +2 more sources
2000
One of the fundamental tasks in image processing is edge detection. High level image processing, such as object recognition, segmentation, image coding, and robot vision, depend on the accuracy of edge detection. Edges contain essential information about an image. Most edge detection techniques are based on finding maxima in the first derivative of the
Anastasios N. Venetsanopoulos +1 more
openaire +2 more sources
One of the fundamental tasks in image processing is edge detection. High level image processing, such as object recognition, segmentation, image coding, and robot vision, depend on the accuracy of edge detection. Edges contain essential information about an image. Most edge detection techniques are based on finding maxima in the first derivative of the
Anastasios N. Venetsanopoulos +1 more
openaire +2 more sources
2007
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Alexander Russell +4 more
openaire +2 more sources
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Alexander Russell +4 more
openaire +2 more sources
1995
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Takao Nishizeki +2 more
openaire +2 more sources
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Takao Nishizeki +2 more
openaire +2 more sources
2016
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +2 more sources
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +2 more sources
Video Caching, Analytics, and Delivery at the Wireless Edge: A Survey and Future Directions
IEEE Communications Surveys and Tutorials, 2021Behrouz Jedari +2 more
exaly
Low-Memory Algorithms for Online Edge Coloring
International Colloquium on Automata, Languages and ProgrammingPrantar Ghosh, Manuel Stoeckl
semanticscholar +1 more source