Results 131 to 140 of about 2,654 (164)
Some of the next articles are maybe not open access.
Kőnig’s edge-colouring theorem for all graphs
Operations Research Letters, 2013We show that the maximum degree of a graph GG is equal to the minimum number of ocm sets covering GG, where an ocm set is the vertex-disjoint union of elementary odd cycles and one matching, and a collection of ocm sets covers GG if every edge is in the matching of an ocm set or in some odd cycle of at least two ocm sets.
Nguyen, Viet Hung, Cornaz, Denis
openaire +4 more sources
Edge Colouring Reduced Indifference Graphs
2000The chromatic index problem – finding the minimum number of colours required for colouring the edges of a graph – is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order.
Celina M. H. de Figueiredo +2 more
openaire +1 more source
Matching, Edge-Colouring, and Dimers
2003We survey some recent results on finding and counting perfect matchings in regular bipartite graphs, with applications to bipartite edge-colouring and the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erdős and
openaire +1 more source
Resource Scheduling in Edge Computing: A Survey
IEEE Communications Surveys and Tutorials, 2021Quyuan Luo, Shihong Hu, Changle Li
exaly
Security and Privacy on 6G Network Edge: A Survey
IEEE Communications Surveys and Tutorials, 2023Bomin Mao, Jiajia Liu, Yingying Wu
exaly
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
IEEE Communications Surveys and Tutorials, 2020Bryan Wei Yang Lim +2 more
exaly
Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
IEEE Communications Surveys and Tutorials, 2020Xiaofei Wang +2 more
exaly
Edge Computing in Industrial Internet of Things: Architecture, Advances and Challenges
IEEE Communications Surveys and Tutorials, 2020Tie Qiu, Jiancheng Chi, Xiaobo Zhou
exaly