![NP-complete problems / Graph partition / Graph / Connected component / Graph coloring / Edge coloring / Graph theory / Theoretical computer science / Mathematics NP-complete problems / Graph partition / Graph / Connected component / Graph coloring / Edge coloring / Graph theory / Theoretical computer science / Mathematics](https://www.pdfsearch.io/img/8a36253381e133224b99b78b4b62a9f1.jpg)
| Document Date: 2013-06-18 18:35:13 Open Document File Size: 1,68 MBShare Result on Facebook
City Hadoop / / Company Vertex / Google / / / Facility Workers store / Jennifer Widom Stanford University / / IndustryTerm bulk synchronous processing / k-means-like graph clustering algorithm / graph algorithm / asynchronous network / graph clustering algorithm / overall clustering algorithm / web-pages / distributed graph-processing systems / open-source graph processing system / graph algorithms / large-scale graph algorithms / Web Services / / Organization National Science Foundation / Stanford University / / Person Pregel / Jennifer Widom / / Position distributed message-passing model of Pregel / programmer / / Product Giraph / / ProgrammingLanguage Java / / SportsLeague Stanford University / / Technology GPS system / graph algorithms / large-scale graph algorithms / graph algorithm / java / API / GPS / following k-means-like graph clustering algorithm / graph clustering algorithm / overall clustering algorithm / /
SocialTag |