Výsledky vyhledávání - "Parallel graph algorithms"

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Autoři: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a další

Zdroj: SIAM Journal on Computing. 53:247-286

Témata: distributed graph algorithms, parallel graph algorithms, (semi-)streaming graph algorithms, metric tree embeddings, low-stretch trees, graph decompositions

Low diameter graph decompositions by approximate distance computation

Autoři: Becker R. Emek Y. Lenzen C. a další

Přispěvatelé: Becker R. Emek Y. Lenzen C. a další

Témata: (semi-)streaming graph algorithm, Distributed graph algorithm, Graph decomposition, Metric tree embedding, Parallel graph algorithms, Settore INF/01 - Informatica

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 11th Innovations in Theoretical Computer Science Conference, ITCS 2020; volume:151; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029564

Dostupnost: https://hdl.handle.net/10278/5029564
https://doi.org/10.4230/LIPIcs.ITCS.2020.50

Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

Autoři: Fuad Jamour Spiros Skiadopoulos Panos Kalnis a další

Přispěvatelé: Fuad Jamour Spiros Skiadopoulos Panos Kalnis a další

Zdroj: IEEE Transactions on Parallel and Distributed Systems. 29:659-672

Témata: Betweenness centrality, parallel graph algorithms, dynamic graph algorithms, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Popis souboru: application/pdf

Přístupová URL adresa: https://repository.kaust.edu.sa/bitstream/10754/625935/1/08070346.pdf
https://dblp.uni-trier.de/db/journals/tpds/tpds29.html#JamourSK18
https://repository.kaust.edu.sa/handle/10754/625935
http://ieeexplore.ieee.org/abstract/document/8070346
https://doi.org/10.1109/TPDS.2017.2763951
https://ieeexplore.ieee.org/document/8070346

Enabling Exploratory Large Scale Graph Analytics through Arkouda

Autoři: Du, Zhihui Rodriguez, Oliver Alvarado Bader, David A.

Zdroj: Faculty Publications

Témata: Breadth-First Search, Exploratory graph analysis, High-Performance Computing, Parallel graph algorithms

Relation: https://digitalcommons.njit.edu/fac_pubs/4465

Dostupnost: https://digitalcommons.njit.edu/fac_pubs/4465
https://doi.org/10.1109/HPEC49654.2021.9622860

Low Diameter Graph Decompositions by Approximate Distance Computation

Autoři: Becker R. Emek Y. Lenzen C. a další

Přispěvatelé: Becker R. Emek Y. Lenzen C. a další

Zdroj: 11th Innovations in Theoretical Computer Science Conference
Leibniz International Proceedings in Informatics

Témata: FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, graph decompositions, Computer Science - Distributed, Parallel, and Cluster Computing, (semi-)streaming graph algorithms, Distributed graph algorithms, Graph decompositions, Metric tree embeddings, Parallel graph algorithms, parallel graph algorithms, distributed graph algorithms, metric tree embeddings, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1909.09002
https://dblp.uni-trier.de/db/journals/corr/corr1909.html#abs-1909-09002
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3193331
https://drops.dagstuhl.de/opus/volltexte/2020/11735/pdf/LIPIcs-ITCS-2020-50.pdf/
https://pure.mpg.de/pubman/item/item_3176434_1/component/file_3176435/arXiv%3A1909.09002.pdf
http://dblp.uni-trier.de/db/journals/corr/corr1909.html#abs-1909-09002
http://arxiv.org/pdf/1909.09002.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.50
http://hdl.handle.net/21.11116/0000-0005-1C67-9
http://hdl.handle.net/21.11116/0000-0005-1C65-B
http://hdl.handle.net/21.11116/0000-0005-A7A7-2

Distributed Graph Diameter Approximation

Autoři: Matteo Ceccarello Andrea Pietracaprina Geppino Pucci a další

Zdroj: Algorithms, Vol 13, Iss 216, p 216 (2020)

Témata: graph analytics, parallel graph algorithms, weighted graph decomposition, weighted diameter approximation, MapReduce, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/1999-4893/13/9/216; https://doaj.org/toc/1999-4893; https://doaj.org/article/cb8ac5b3f70c40c08c2de66f18f0c972

Dostupnost: https://doi.org/10.3390/a13090216
https://doaj.org/article/cb8ac5b3f70c40c08c2de66f18f0c972

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Autoři: CECCARELLO, MATTEO PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO a další

Zdroj: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. :182-191

Témata: Parallel Graph Algorithms, Graph Decomposition, k-Center Problem, Diameter Approximation, MapReduce, FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 02 engineering and technology

Přístupová URL adresa: http://arxiv.org/pdf/1407.3144
http://arxiv.org/abs/1407.3144
https://dblp.uni-trier.de/db/conf/spaa/spaa2015.html#CeccarelloPPU15
https://core.ac.uk/display/53518954
https://dl.acm.org/doi/10.1145/2755573.2755591
https://dl.acm.org/citation.cfm?id=2755591
http://dl.acm.org/citation.cfm?doid=2755573.2755591
https://doi.org/10.1145/2755573.2755591
https://hdl.handle.net/11577/3156391

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Autoři: Blanusa, Jovan Atasu, Kubilay Ienne, Paolo

Zdroj: WoS

Témata: Technology, Cycle Enumeration, Parallel Graph Algorithms, Graph Pattern Mining

Relation: Acm Transactions On Parallel Computing; https://infoscience.epfl.ch/handle/20.500.14299/203837; WOS:001080454800002

Dostupnost: https://doi.org/10.1145/3611642
https://infoscience.epfl.ch/handle/20.500.14299/203837
https://hdl.handle.net/20.500.14299/203837

Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

Autoři: Wijs, Anton Katoen, Joost-Pieter Bošnački, Dragan

Zdroj: Formal methods in system design 48(3), 274-300 (2016). doi:10.1007/s10703-016-0246-7

Témata: Maximal end components, Strongly connected components, Hardware and Architecture, GPU, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Parallel graph algorithms, Probabilistic model checking, Software, Markov decision processes, Theoretical Computer Science

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10703-016-0246-7.pdf
https://research.tue.nl/en/publications/fbec4459-c3de-4824-a79c-4accac00aa62
https://doi.org/10.1007/s10703-016-0246-7
https://dblp.uni-trier.de/db/journals/fmsd/fmsd48.html#WijsKB16
https://paperity.org/p/75801580/efficient-gpu-algorithms-for-parallel-decomposition-of-graphs-into-strongly-connected-and
https://research.tue.nl/en/publications/efficient-gpu-algorithms-for-parallel-decomposition-of-graphs-int
https://link.springer.com/content/pdf/10.1007%2Fs10703-016-0246-7.pdf
https://pure.tue.nl/ws/files/53354111/art_3A10.1007_2Fs10703_016_0246_7.pdf
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ffbec4459-c3de-4824-a79c-4accac00aa62
https://publications.rwth-aachen.de/record/674301

Counting triangles in large graphs on GPU

Autoři: Polak, Adam

Přispěvatelé: Polak, Adam

Témata: CLUSTERING COEFFICIENT, CUDA, GPU, PARALLEL GRAPH ALGORITHMS, TRIANGLES

Popis souboru: ELETTRONICO

Relation: info:eu-repo/semantics/altIdentifier/isbn/9781509036820; info:eu-repo/semantics/altIdentifier/wos/WOS:000391253600086; ispartofbook:Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016; 30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016; numberofpages:7; https://hdl.handle.net/11565/4061820; https://ieeexplore.ieee.org/document/7529936

Dostupnost: https://hdl.handle.net/11565/4061820
https://doi.org/10.1109/IPDPSW.2016.108
https://ieeexplore.ieee.org/document/7529936

SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems

Autoři: Besta, Maciej Kanakagiri, Raghavendra Kwasniewski, Grzegorz a další

Zdroj: MICRO '21: MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture

Témata: Graph Mining, Graph Pattern Matching, Graph Learning, Clique Mining, Clique Listing, Clique Enumeration, Subgraph Isomorphism, Parallel Graph Algorithms, Processing In Memory, Processing Near Memory, Graph Accelerators, Instruction Set Architecture

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-4503-8557-2; http://hdl.handle.net/20.500.11850/515704

Dostupnost: https://hdl.handle.net/20.500.11850/515704

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs

Autoři: CECCARELLO, MATTEO PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO a další

Zdroj: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

Témata: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), 02 engineering and technology, Graph Analytics, Parallel Graph Algorithms, Weighted Graph Decomposition, Weighted Diameter Approximation, MapReduce

Přístupová URL adresa: http://arxiv.org/pdf/1506.03265
http://arxiv.org/abs/1506.03265
https://dblp.uni-trier.de/db/journals/corr/corr1506.html#CeccarelloPPU15
http://ieeexplore.ieee.org/document/7515997/
https://www.arxiv-vanity.com/papers/1506.03265/
https://ui.adsabs.harvard.edu/abs/2015arXiv150603265C/abstract
http://dblp.uni-trier.de/db/conf/ipps/ipdps2016.html#CeccarelloPPU16
https://ieeexplore.ieee.org/abstract/document/7515997

Dynamic trees as search trees via euler tours, applied to the network simplex algorithm: Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm

Autoři: Tarjan, Robert E.

Zdroj: Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona

Témata: Euler tours, parallel graph algorithms, 0102 computer and information sciences, Programming involving graphs or networks, dynamic tree, network simplex, Matemàtica, 01 natural sciences

Popis souboru: application/pdf; application/xml

Přístupová URL adresa: https://ddd.uab.cat/record/114
https://dblp.uni-trier.de/db/journals/mp/mp78.html#Tarjan97
https://collaborate.princeton.edu/en/publications/dynamic-trees-as-search-trees-via-euler-tours-applied-to-the-netw
https://link.springer.com/article/10.1007/BF02614369
https://ddd.uab.cat/record/114
https://ddd.uab.cat/uab/matpro/00255610v78n2p169.pdf

AM++: A generalized active message framework

Autoři: Jeremiah J. Willcock Torsten Hoefler Andrew Lumsdaine a další

Přispěvatelé: Jeremiah J. Willcock Torsten Hoefler Andrew Lumsdaine a další

Zdroj: http://www.unixer.de/publications//img/willcock-amplusplus.pdf.

Témata: Parallel Graph Algorithms, Parallel Programming Interfaces

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7981

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7981
http://www.unixer.de/publications//img/willcock-amplusplus.pdf

Parallel Influence Maximization Algorithms and Their Applications

Autoři: Minutoli, Marco Kalyanaraman, Ananth Halappanavar, Mahantesh a další

Přispěvatelé: Minutoli, Marco Kalyanaraman, Ananth Halappanavar, Mahantesh a další

Témata: Epidemic Control, Exascale, GPU Acceleration, Influence Maximization, Parallel Graph Algorithms, Computer science

Popis souboru: pdf

Relation: 2376/120461; 99900606549701842; https://rex.libraries.wsu.edu/view/delivery/01ALLIANCE_WSU/12354043980001842/13354043970001842; alma:01ALLIANCE_WSU/bibs/99900606549701842

Dostupnost: https://doi.org/10.7273/000001851
https://rex.libraries.wsu.edu/esploro/outputs/doctoral/Parallel-Influence-Maximization-Algorithms-and-Their/99900606549701842
https://rex.libraries.wsu.edu/view/delivery/01ALLIANCE_WSU/12354043980001842/13354043970001842

Betweenness Centrality: Algorithms and Lower Bounds

Autoři: Shiva Kintali The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Shiva Kintali The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/0809.1906v1.pdf.

Témata: betweenness centrality, all-pairs shortest paths, social networks, parallel graph algorithms, network algorithms

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.311.8472; http://arxiv.org/pdf/0809.1906v1.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.311.8472
http://arxiv.org/pdf/0809.1906v1.pdf

Abstract

Autoři: Albert Chan Andrew Rau-chaplin Chunmei Gao a další

Přispěvatelé: Albert Chan Andrew Rau-chaplin Chunmei Gao a další

Zdroj: http://users.cs.dal.ca/~arc/publications/2-38/paper.pdf.

Témata: Single Link Clustering, Closest Larger Ancestor, Parallel Graph Algorithms, Coarse Grained Multicomputer, Hierarchical Agglomerative Clustering

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3443

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3443
http://users.cs.dal.ca/~arc/publications/2-38/paper.pdf

The Euler tour technique and parallel rooted spanning tree

Autoři: Guojing Cong David A. Bader The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Guojing Cong David A. Bader The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.phylo.org/docs/RootedSpanningTree.pdf.

Témata: Spanning Tree, Euler Tour, Parallel Graph Algorithms, Shared Memory, High-Performance Algorithm Engineering

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.8996; http://www.phylo.org/docs/RootedSpanningTree.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.8996
http://www.phylo.org/docs/RootedSpanningTree.pdf

A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering

Autoři: Chan, Albert Gao, Chunmei Rau-Chaplin, Andrew

Zdroj: Lecture Notes in Computer Science ISBN: 9783540290315

Témata: Coarse Grained Multicomputer, Parallel Graph Algorithms, Hierarchical Agglomerative Clustering, Single Link Clustering, Closest Larger Ancestor

Přístupová URL adresa: https://link.springer.com/chapter/10.1007/11557654_96
https://web.cs.dal.ca/~arc/publications/2-38/paper.pdf
https://link.springer.com/content/pdf/10.1007%2F11557654_96.pdf
https://www.cs.dal.ca/~arc/publications/2-38/paper.pdf
https://dblp.uni-trier.de/db/conf/hpcc/hpcc2005.html#ChanGR05
https://rd.springer.com/chapter/10.1007/11557654_96

Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.unm.edu/~treport/tr/03-12/MST-bader.pdf.

Témata: Parallel Graph Algorithms, Shared Memory, High-Performance Algorithm Engineering

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.2810

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.2810
http://www.cs.unm.edu/~treport/tr/03-12/MST-bader.pdf