Matches in SemOpenAlex for { <https://semopenalex.org/work/W2029596143> ?p ?o ?g. }
Showing items 1 to 50 of
50
with 100 items per page.
- W2029596143 abstract "Counting triangles in networks is a fundamental problem in network science. In addition, because we are forced to manage very large real-world networks, current triangle counting algorithms naturally require a distributed computing system. In this paper, we propose a distributed triangle counting algorithm based on both the vertex-centric and node-iterator models and using the multi-level branching technique. Multi-level branching is a method that constructs an ordered graph structure based on levels. This method not only facilitates an efficient triangle counting process, but also guarantees the computational integrity of each split in the distributed triangle counting process. First, we describe a level-based triangle counting algorithm based on both the vertex-centric model and the node-iterator algorithm. Then, we develop a distributed implementation of the proposed algorithm using GraphChi. The main advantages of the proposed algorithm are that the execution is simple yet effective, and thus its parallelization is efficient. Experiments on real-world networks verify its performance, particularly, its near-linear parallelization scalability." @default.
- W2029596143 created "2016-06-24" @default.
- W2029596143 creator A5011058984 @default.
- W2029596143 creator A5031046113 @default.
- W2029596143 creator A5059558668 @default.
- W2029596143 creator A5085010633 @default.
- W2029596143 date "2015-02-01" @default.
- W2029596143 modified "2023-09-27" @default.
- W2029596143 title "Triangle counting in networks using a multi-level branching technique" @default.
- W2029596143 cites W2002203222 @default.
- W2029596143 cites W2007954020 @default.
- W2029596143 cites W2031082424 @default.
- W2029596143 cites W2112090702 @default.
- W2029596143 cites W2123068254 @default.
- W2029596143 doi "https://doi.org/10.1109/35021bigcomp.2015.7072849" @default.
- W2029596143 hasPublicationYear "2015" @default.
- W2029596143 type Work @default.
- W2029596143 sameAs 2029596143 @default.
- W2029596143 citedByCount "1" @default.
- W2029596143 countsByYear W20295961432020 @default.
- W2029596143 crossrefType "proceedings-article" @default.
- W2029596143 hasAuthorship W2029596143A5011058984 @default.
- W2029596143 hasAuthorship W2029596143A5031046113 @default.
- W2029596143 hasAuthorship W2029596143A5059558668 @default.
- W2029596143 hasAuthorship W2029596143A5085010633 @default.
- W2029596143 hasConcept C159985019 @default.
- W2029596143 hasConcept C192562407 @default.
- W2029596143 hasConcept C206175624 @default.
- W2029596143 hasConcept C41008148 @default.
- W2029596143 hasConceptScore W2029596143C159985019 @default.
- W2029596143 hasConceptScore W2029596143C192562407 @default.
- W2029596143 hasConceptScore W2029596143C206175624 @default.
- W2029596143 hasConceptScore W2029596143C41008148 @default.
- W2029596143 hasLocation W20295961431 @default.
- W2029596143 hasOpenAccess W2029596143 @default.
- W2029596143 hasPrimaryLocation W20295961431 @default.
- W2029596143 hasRelatedWork W1974919125 @default.
- W2029596143 hasRelatedWork W2014836299 @default.
- W2029596143 hasRelatedWork W2034871982 @default.
- W2029596143 hasRelatedWork W2036711164 @default.
- W2029596143 hasRelatedWork W2148974013 @default.
- W2029596143 hasRelatedWork W2358668433 @default.
- W2029596143 hasRelatedWork W2390279801 @default.
- W2029596143 hasRelatedWork W2748952813 @default.
- W2029596143 hasRelatedWork W2899084033 @default.
- W2029596143 hasRelatedWork W2462424100 @default.
- W2029596143 isParatext "false" @default.
- W2029596143 isRetracted "false" @default.
- W2029596143 magId "2029596143" @default.
- W2029596143 workType "article" @default.