Search Results - "Parallel graph algorithm"
-
1
Authors:
Source: Concurrency and Computation. 38(1)
Subject Terms: approximate computing, parallel graph algorithm, state transition graph
File Description: electronic
-
2
Authors: et al.
Source: Proceedings of the 48th International Conference on Parallel Processing. :1-10
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences, 0105 earth and related environmental sciences
Access URL: https://www.osti.gov/biblio/1640814
-
3
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783031048876
-
4
-
5
Authors: Uchida, Tomoyuki
Index Terms: Technical Report., AM.
URL:
https://hdl.handle.net/2324/3182 http://www.i.kyushu-u.ac.jp/research/report.html https://catalog.lib.kyushu-u.ac.jp/opac_download_md/3182/rifis-tr-83.pdf
RIFIS Technical Report || 83 || p1-112 -
6
Authors: Vijaya Ramachandran
Source: Lecture Notes in Computer Science ISBN: 9783540518594
-
7
Source: Formal Graph Systems and Parallel Graph Algorithm Design. 83
-
8
-
9
Authors: et al.
Source: Faculty Publications
Subject Terms: Dynamic graph, GPU, Parallel graph algorithm, Transitive closure
-
10
Authors:
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
-
11
Authors:
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 -
12
Authors:
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, 01 natural sciences, 7. Clean energy, polylog time algorithm
File Description: application/xml
-
13
Authors: et al.
Contributors: et al.
Subject Terms: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
File Description: 63 p.; application/pdf
Relation: https://hdl.handle.net/10356/48790
Availability: https://hdl.handle.net/10356/48790
-
14
Authors: Yung H. Tsin
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
-
15
Authors:
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
-
16
Authors: Hirschberg, D.S.
Subject Terms: graph theory, parallel processing, algorithms, connected components
File Description: application/pdf
Relation: D. Hirschberg, "A Parallel Graph Algorithm for Finding Connected Components," Rice University ECE Technical Report, no. TR7518, 1975.; https://hdl.handle.net/1911/19953
Availability: https://hdl.handle.net/1911/19953
-
17
Authors:
Contributors:
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
-
18
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
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 -
19
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 -
20
Authors:
Source: Communications on Applied Mathematics & Computation; Jun2025, Vol. 7 Issue 3, p987-1001, 15p
Full Text Finder 
Nájsť tento článok vo Web of Science