zweidimensionales bewegtes Bild
Nearly-linear increasing paths in edge-ordered graphs
- Weitere Titel
-
Nearly-linear monotone paths in edge-ordered graphs
- Standort
-
Hannover TIB
- Umfang
-
207MB, 00:34:52:26 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Workshop on Probabilistic and Extremal Combinatorics (19w5009) ; (Jan. 2019)
- Schlagwort
-
Bucic, Matija
- Ereignis
-
Veröffentlichung
- (wer)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (wann)
-
2019-01-01
- Beteiligte Personen und Organisationen
-
Bucić, Matija
Sudakov, Benny (Organization)
Haxell, Penny (Organization)
Krivelevich, Michael (Organization)
- DOI
-
10.5446/56083
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
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
- Bucić, Matija
- Sudakov, Benny (Organization)
- Haxell, Penny (Organization)
- Krivelevich, Michael (Organization)
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Entstanden
- 2019-01-01
Ähnliche Objekte (12)
Minimal paths on ordered graphs
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
The Complexity of Packing Edge-Disjoint Paths
Lifted edges as connectivity priors for multicut and disjoint paths
Nearly Roadkill
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
Etude consommateurs nearly zero energy building : = Verbraucherbefragung Nearly Zero Energy Building
Nearly projective Boolean algebras
Isospectral nearly Kaehler manifolds
Martin Heidegger : paths taken, paths opened
On k-bend and monotonic l-bend edge intersection graphs of paths on a grid
Minimal paths on ordered graphs
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
The Complexity of Packing Edge-Disjoint Paths
Lifted edges as connectivity priors for multicut and disjoint paths
Nearly Roadkill
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
Etude consommateurs nearly zero energy building : = Verbraucherbefragung Nearly Zero Energy Building
Nearly projective Boolean algebras
Isospectral nearly Kaehler manifolds
Martin Heidegger : paths taken, paths opened
On k-bend and monotonic l-bend edge intersection graphs of paths on a grid
Minimal paths on ordered graphs
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
The Complexity of Packing Edge-Disjoint Paths
Lifted edges as connectivity priors for multicut and disjoint paths
Nearly Roadkill
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
Etude consommateurs nearly zero energy building : = Verbraucherbefragung Nearly Zero Energy Building
Nearly projective Boolean algebras
Isospectral nearly Kaehler manifolds
Martin Heidegger : paths taken, paths opened