zweidimensionales bewegtes Bild
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
- Sprache
-
Englisch
- Umfang
-
208MB, 00:31:21:21 (unknown)
- Anmerkungen
-
Audiovisuelles Material
- Standort
-
Hannover TIB
- Erschienen in
-
Analytic techniques in Theoretical Computer Science (18w5197) ; (Jan. 2018)
- Beteiligte Personen und Organisationen
-
Schramm, Tselil
- Ereignis
-
Veröffentlichung
- (wer)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (wann)
-
2018-01-01
- DOI
-
10.5446/59346
- Letzte Aktualisierung
-
2024-12-04T08:09:49+0100
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Schramm, Tselil
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Entstanden
- 2018-01-01
Ähnliche Objekte (12)
The component structure of random graphs : phase transitions in random graphs and random graph processes
The phase transition in random graphs and random graph processes
Matching on Bipartite Graphs
Constrained random graph processes
Maximale Flüsse in fast-planaren Graphen = Maximum flows in nearly planar graphs
Random planar structures and random graph processes
Matching minors in bipartite graphs
Structural Graph-based Metamodel Matching
Graph factors and matching extensions
Matching minors in bipartite graphs
Structural graph-based metamodel matching
Hard Problems on Random Graphs
The component structure of random graphs : phase transitions in random graphs and random graph processes
The phase transition in random graphs and random graph processes
Matching on Bipartite Graphs
Constrained random graph processes
Maximale Flüsse in fast-planaren Graphen = Maximum flows in nearly planar graphs
Random planar structures and random graph processes
Matching minors in bipartite graphs
Structural Graph-based Metamodel Matching
Graph factors and matching extensions
Matching minors in bipartite graphs
Structural graph-based metamodel matching
Hard Problems on Random Graphs
The component structure of random graphs : phase transitions in random graphs and random graph processes
The phase transition in random graphs and random graph processes
Matching on Bipartite Graphs
Constrained random graph processes
Maximale Flüsse in fast-planaren Graphen = Maximum flows in nearly planar graphs
Random planar structures and random graph processes
Matching minors in bipartite graphs
Structural Graph-based Metamodel Matching
Graph factors and matching extensions
Matching minors in bipartite graphs
Structural graph-based metamodel matching