- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Event
-
Veröffentlichung
- (where)
-
Köln
- (who)
-
Universitäts- und Stadtbibliothek Köln
- (when)
-
2001
- Creator
-
Bolten, Eva
Schliep, Alexander
Schneckener, Sebastian
Schomburg, Dietmar
Schrader, Rainer
- URN
-
urn:nbn:de:hbz:38-548559
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:29 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bolten, Eva
- Schliep, Alexander
- Schneckener, Sebastian
- Schomburg, Dietmar
- Schrader, Rainer
- Universitäts- und Stadtbibliothek Köln
Time of origin
- 2001
Other Objects (12)
Strongly Proper Connected Coloring of Graphs
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
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
Amenability, connected components, and definable actions
Degree sequence for k-arc strongly connected multiple digraphs
7th HLF – Lecture: Concurrent Connected Components Algorithms
Molecular entanglement can strongly increase basicity
The Role of Largest Connected Components in Collective Motion
Everything can be connected to everything else!
Can Connected Machines Learn to Behave Ethically?
A Lexicon of Connected Components for Arabic Optical Text Recognition
Strongly Proper Connected Coloring of Graphs
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
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
Amenability, connected components, and definable actions
Degree sequence for k-arc strongly connected multiple digraphs
7th HLF – Lecture: Concurrent Connected Components Algorithms
Molecular entanglement can strongly increase basicity
The Role of Largest Connected Components in Collective Motion
Everything can be connected to everything else!
Can Connected Machines Learn to Behave Ethically?
A Lexicon of Connected Components for Arabic Optical Text Recognition
Strongly Proper Connected Coloring of Graphs
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
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
Amenability, connected components, and definable actions
Degree sequence for k-arc strongly connected multiple digraphs
7th HLF – Lecture: Concurrent Connected Components Algorithms
Molecular entanglement can strongly increase basicity
The Role of Largest Connected Components in Collective Motion
Everything can be connected to everything else!
Can Connected Machines Learn to Behave Ethically?