- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: arXiv, 2304.09654v1, 24 S.
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2023
- Urheber
-
Allendorf, Daniel
- DOI
-
10.48550/arXiv.2304.09654
- URN
-
urn:nbn:de:hebis:30:3-861335
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:02 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
- Allendorf, Daniel
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2023
Ähnliche Objekte (12)
Uniform generation of temporal graphs with given degrees
Spectral Partitioning of Random Graphs with Given Expected Degrees - Detailed Version
Near-critical SIR epidemic on a random graph with given degrees
Critical percolation on networks with given degrees
A Note on the Markovian SIR Epidemic on a Random Graph with Given Degrees
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Smallest graphs with given automorphism group
Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence
Distinguishing numbers of infinite graphs with bounded degrees
Uniform Metric Graphs
Uniform generation of temporal graphs with given degrees
Spectral Partitioning of Random Graphs with Given Expected Degrees - Detailed Version
Near-critical SIR epidemic on a random graph with given degrees
Critical percolation on networks with given degrees
A Note on the Markovian SIR Epidemic on a Random Graph with Given Degrees
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Smallest graphs with given automorphism group
Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence
Distinguishing numbers of infinite graphs with bounded degrees
Uniform Metric Graphs
Uniform generation of temporal graphs with given degrees
Spectral Partitioning of Random Graphs with Given Expected Degrees - Detailed Version
Near-critical SIR epidemic on a random graph with given degrees
Critical percolation on networks with given degrees
A Note on the Markovian SIR Epidemic on a Random Graph with Given Degrees
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Smallest graphs with given automorphism group
Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence
Distinguishing numbers of infinite graphs with bounded degrees