Distributed graph coloring algorithm based on Pregel
A graph coloring and distributed technology, applied in the field of graph coloring algorithms, can solve problems such as the inability to directly apply the Pregel message passing model, achieve the effect of reducing the number of colors and improving performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0043] The present invention will be further described below in conjunction with the accompanying drawings. In order to make the description concise and intuitive, the algorithm description in this embodiment is embodied in algorithmic sentences.
[0044] See figure 1 , the basic algorithm based on Pregel's distributed graph coloring algorithm in the present invention is the MIS-Pregel algorithm as follows:
[0045] Algorithm 1. MIS-Pregel algorithm.
[0046] Input: RDF graph T;
[0047] Output: Colored interferogram G c
[0048]
[0049] see figure 2 , in the first scheme of the present invention, the algorithm of applying the Pregel model to find the largest independent set is as follows:
[0050] Algorithm 2, based on the Pregel model to find the largest independent set algorithm.
[0051] Input: Interferogram G'=(V',E') with weights;
[0052] Output: The largest independent set S of the input interferograms.
[0053]
[0054]
[0055] see image 3 , the ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com