Français
Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity
Multi angle
Authors : Wagner, Uli (Author of the conference)
CIRM (Publisher )
57Q35 - Embeddings and immersions
68Q17 - Computational difficulty of problems
CIRM (Publisher )
Loading the player...
|
Abstract :
MSC Codes : 57Q35 - Embeddings and immersions
68Q17 - Computational difficulty of problems
|
Information on the Video
Film maker : Hennenfent, GuillaumeLanguage : English Available date : 26/05/2016 Conference Date : 12/05/2016 Subseries : Research School arXiv category : Combinatorics ; Computer Science ; Geometric Topology Mathematical Area(s) : Combinatorics ; Computer Science ; Topology Format : MP4 (.mp4) - HD Video Time : 01:40:06 Targeted Audience : Researchers ; Graduate Students Download : https://videos.cirm-math.fr/2016-05-12_Wagner.mp4 
|
Information on the Event
Event Title : Graphs and surfaces: algorithms, combinatorics and topology / Graphes et surfaces : algorithmique, combinatoire et topologieEvent Organizers : Colin de Verdière, Éric ; Schaeffer, Gilles Dates : 09/05/2016 - 13/05/2016 Event Year : 2016 Event URL : http://conferences.cirm-math.fr/1438.html
Citation Data
DOI : 10.24350/CIRM.V.18968203Cite this video as: Wagner, Uli (2016). Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.18968203 URI : http://dx.doi.org/10.24350/CIRM.V.18968203 |
See Also
- [Multi angle] Embedding extension problems / Author of the conference Mohar, Bojan.
- [Multi angle] Bidimensionality and subexponential parameterized algorithms / Author of the conference Thilikos, Dimitrios.
- [Post-edited] Coloring graphs on surfaces / Author of the conference Esperet, Louis.
Bibliography
