[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Vella et al., 2018 - Google Patents

Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality

Vella et al., 2018

Document ID
11340951232110679132
Author
Vella F
Bernaschi M
Carbone G
Publication year
Publication venue
Journal of Experimental Algorithmics (JEA)

External Links

Snippet

Betweenness Centrality (BC) is a widely used metric of the relevance of a node in a network. The fastest-known algorithm for the evaluation of BC on unweighted graphs builds a tree representing information about the shortest paths for each vertex to calculate its contribution …
Continue reading at dl.acm.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
    • G06F9/524—Deadlock detection or avoidance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Jia et al. TASO: optimizing deep learning computation with automatic generation of graph substitutions
Bader et al. Parallel algorithms for evaluating centrality indices in real-world networks
Prountzos et al. Betweenness centrality: algorithms and implementations
Jin et al. Path-tree: An efficient reachability indexing scheme for large directed graphs
Sariyuce et al. Local algorithms for hierarchical dense subgraph discovery
Pradhan et al. Finding all-pairs shortest path for a large-scale transportation network using parallel Floyd-Warshall and parallel Dijkstra algorithms
Dhulipala et al. Sage: Parallel semi-asymmetric graph algorithms for NVRAMs
Madduri et al. Parallel Shortest Path Algorithms for Solving Large-Scale Instances.
Shekhovtsov et al. A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
Yasui et al. Fast and scalable NUMA-based thread parallel breadth-first search
Shun An evaluation of parallel eccentricity estimation algorithms on undirected real-world graphs
van Dijk Sylvan: multi-core decision diagrams
Sarıyüce et al. Parallel local algorithms for core, truss, and nucleus decompositions
Gabert et al. A unifying framework to identify dense subgraphs on streams: Graph nuclei to hypergraph cores
Vella et al. Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
Khan et al. Designing scalable b-matching algorithms on distributed memory multiprocessors by approximation
Tan et al. Lightrw: Fpga accelerated graph dynamic random walks
Tench et al. GraphZeppelin: Storage-friendly sketching for connected components on dynamic graph streams
Bernaschi et al. Multilevel parallelism for the exploration of large-scale graphs
Hyvärinen Grid based propositional satisfiability solving
Zhou A practical scalable shared-memory parallel algorithm for computing minimum spanning trees
Bhuiyan et al. A parallel algorithm for generating a random graph with a prescribed degree sequence
Buš et al. Towards auction algorithms for large dense assignment problems
Roostapour et al. Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem
McLaughlin et al. Fast execution of simultaneous breadth-first searches on sparse graphs