An experimental study of external memory algorithms for connected components
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Leibniz International Proceedings in Informatics (LIPIcs) ; 190, 23, 19th International Symposium on Experimental Algorithms (SEA 2021), doi:10.4230/LIPIcs.SEA.2021.23, ISBN 978-3-95977-185-6, ISSN 1868-8969
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2021
- Urheber
- URN
-
urn:nbn:de:hebis:30:3-589660
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:37 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Brodal, Gerth Stølting
- Fagerberg, Rolf
- Hammer, David
- Meyer, Ulrich
- Penschuck, Manuel
- Tran, Hung
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2021
Ähnliche Objekte (12)
7th HLF – Lecture: Concurrent Connected Components Algorithms
External memory algorithms for geographic information systems
Amenability, connected components, and definable actions
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
LEDA-SM: external memory algorithms and data structure in theory and practice
Graph algorithms for approximate and dynamic settings in the external-memory model
LEDA-SM: external memory algorithms and data structures in theory and practice
Strongly Connected Components can Predict Protein Structure
External memory algorithms for state space exploration in model checking and action planning
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
7th HLF – Lecture: Concurrent Connected Components Algorithms
External memory algorithms for geographic information systems
Amenability, connected components, and definable actions
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
LEDA-SM: external memory algorithms and data structure in theory and practice
Graph algorithms for approximate and dynamic settings in the external-memory model
LEDA-SM: external memory algorithms and data structures in theory and practice
Strongly Connected Components can Predict Protein Structure
External memory algorithms for state space exploration in model checking and action planning
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
7th HLF – Lecture: Concurrent Connected Components Algorithms
External memory algorithms for geographic information systems
Amenability, connected components, and definable actions
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
LEDA-SM: external memory algorithms and data structure in theory and practice
Graph algorithms for approximate and dynamic settings in the external-memory model
LEDA-SM: external memory algorithms and data structures in theory and practice
Strongly Connected Components can Predict Protein Structure
External memory algorithms for state space exploration in model checking and action planning