Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
Stefanes MA, Rubert D, Soares J (2020)
Theoretical Computer Science 804: 58-71.
Zeitschriftenaufsatz
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Stefanes, Marco A.;
Rubert, DiegoUniBi 
;
Soares, José
;
Soares, JoséEinrichtung
Stichworte
Convex bipartite graphs;
Graph matching;
Linear-time Hamiltonian circuit;
Coarse grained parallel computing
Erscheinungsjahr
2020
Zeitschriftentitel
Theoretical Computer Science
Band
804
Seite(n)
58-71
ISSN
0304-3975
Page URI
https://pub.uni-bielefeld.de/record/2965062
Zitieren
Stefanes MA, Rubert D, Soares J. Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science. 2020;804:58-71.
Stefanes, M. A., Rubert, D., & Soares, J. (2020). Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science, 804, 58-71. https://doi.org/10.1016/j.tcs.2019.10.042
Stefanes, Marco A., Rubert, Diego, and Soares, José. 2020. “Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs”. Theoretical Computer Science 804: 58-71.
Stefanes, M. A., Rubert, D., and Soares, J. (2020). Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science 804, 58-71.
Stefanes, M.A., Rubert, D., & Soares, J., 2020. Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science, 804, p 58-71.
M.A. Stefanes, D. Rubert, and J. Soares, “Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs”, Theoretical Computer Science, vol. 804, 2020, pp. 58-71.
Stefanes, M.A., Rubert, D., Soares, J.: Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science. 804, 58-71 (2020).
Stefanes, Marco A., Rubert, Diego, and Soares, José. “Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs”. Theoretical Computer Science 804 (2020): 58-71.
Link(s) zu Volltext(en)
Access Level
Closed Access
Export
Markieren/ Markierung löschen
Markierte Publikationen
Web of Science
Dieser Datensatz im Web of Science®Suchen in
Google Scholar