Search Results - "parallel graph algorithm"

Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint

Authors: Keller, Jorg Litzinger, Sebastian

Source: Concurrency and Computation. 38(1)

Subject Terms: approximate computing, parallel graph algorithm, state transition graph

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-220958
https://doi.org/10.1002/cpe.70502

Anti-Section Transitive Closure

Authors: Green, Oded Du, Zhihui Patel, Sanyamee et al.

Source: Faculty Publications

Subject Terms: Dynamic graph, GPU, Parallel graph algorithm, Transitive closure

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

Availability: https://digitalcommons.njit.edu/fac_pubs/4531
https://doi.org/10.1109/HiPC53243.2021.00033

Complex Network Partitioning Using Label Propagation: Complex network partitioning using label propagation

Authors: Slota, George M. Madduri, Kamesh Rajamanickam, Sivasankaran

Source: SIAM Journal on Scientific Computing. 38:S620-S645

Subject Terms: label propagation, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, partitioning, parallel graph algorithm, 0202 electrical engineering, electronic engineering, information engineering, small-world graph, 02 engineering and technology, Parallel algorithms in computer science, Small world graphs, complex networks (graph-theoretic aspects), 7. Clean energy

File Description: application/xml

Access URL: https://zbmath.org/6645438
https://doi.org/10.1137/15m1026183

Deciding whether graph G has page number one is in NC: Deciding whether graph \(G\) has page number one is in NC

Authors: Masuyama, Shigeru Naito, Shozo

Source: Information Processing Letters. 44:7-10

Subject Terms: class NC, page number one, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 4. Education, parallel graph algorithm, Distributed algorithms, 0102 computer and information sciences, forbidden subgraph, 7. Clean energy, 01 natural sciences, polylog time algorithm

File Description: application/xml

Access URL: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/0790-22.pdf

Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems: Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems

Authors: Das, Sajal K. Yang, Cui-Qing

Source: Parallel Computing. 17:527-551

Subject Terms: Graph theory (including graph drawing) in computer science, parallel graph algorithm, transputer, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, Unix, 01 natural sciences, Performance evaluation, queueing, and scheduling in the context of computer systems

File Description: application/xml

Access URL: https://zbmath.org/24155
https://doi.org/10.1016/s0167-8191(05)80155-3

An optimal parallel processor bound in strong orientation of an undirected graph

Authors: Tsin, Yung Hyang

Source: Information Processing Letters. 20:143-146

Subject Terms: PRAM, Analysis of algorithms and problem complexity, parallel graph algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph theory, analysis of algorithms, undirected graph, SIMD shared memory model, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, parallel computation, dense graphs

File Description: application/xml

An Efficient Parallel Biconnectivity Algorithm: An efficient parallel biconnectivity algorithm

Authors: Tarjan, Robert E. Vishkin, Uzi

Source: SIAM Journal on Computing. 14:862-874

Subject Terms: biconnected components, Connectivity, spanning tree, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, parallel graph algorithm, blocks, 0102 computer and information sciences, 01 natural sciences

File Description: application/xml

Access URL: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

An efficient parallel biconnectivity algorithm

Authors: Robert E. Tarjan The Pennsylvania State University CiteSeerX Archives

Contributors: Robert E. Tarjan The Pennsylvania State University CiteSeerX Archives

Source: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf.

Subject Terms: Key words, parallel graph algorithm, biconnected components, blocks

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898; http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898
http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

FINDING BICONNECTED COMPONEMTS AND COMPUTING TREE FUNCTIONS IN LOGARITHMIC PARALLEL TIME Extended Summary

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.mpi-inf.mpg.de/departments/d1/teaching/ws10/models_of_computation/Tarjan, Vishkin - 1984 - Finding biconnected components and computing tree functions in logarithmic parallel time.pdf.

Subject Terms: Parallel graph algorithm, biconnected components

File Description: application/pdf

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.3088
http://www.mpi-inf.mpg.de/departments/d1/teaching/ws10/models_of_computation/Tarjan, Vishkin - 1984 - Finding biconnected components and computing tree functions in logarithmic parallel time.pdf

On handling vertex deletion in updating minimum spanning trees

Authors: Tsin, Yung Hyang

Source: Information Processing Letters. 27:167-168

Subject Terms: Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, updating of minimum spanning trees, parallel graph algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, parallel computation, vertex deletion, incremental algorithm, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/4055069
https://doi.org/10.1016/0020-0190(88)90020-8