- Location
-
Hannover TIB
- Extent
-
70MB, 00:23:51:06 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
Geometric and Structural Graph Theory (17w5154) ; (Jan. 2017)
- Keyword
-
Discrete mathematics
Combinatorics
Mathematics
Computer science
- Event
-
Veröffentlichung
- (who)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (when)
-
2017-01-01
- Contributor
-
Tancer, Martin
- DOI
-
10.14288/1.0365552
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Tancer, Martin
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Time of origin
- 2017-01-01
Other Objects (12)
Distributed shortest-path computation
Shortest path network problems
Exploring Graph Partitioning for Shortest Path Queries on Road Networks
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Foldingfree coverings and graph embeddings
Drawing Shortest Paths in Geodetic Graphs
Distributed shortest-path computation
Shortest path network problems
Exploring Graph Partitioning for Shortest Path Queries on Road Networks
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Foldingfree coverings and graph embeddings
Drawing Shortest Paths in Geodetic Graphs
Distributed shortest-path computation
Shortest path network problems
Exploring Graph Partitioning for Shortest Path Queries on Road Networks
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Foldingfree coverings and graph embeddings