Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity

Appears in collection : Graphs and surfaces: algorithms, combinatorics and topology / Graphes et surfaces : algorithmique, combinatoire et topologie

Information about the video

Date of recording 12/05/2016
Date of publication 26/05/2016
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.18968203
Cite this video Wagner, Uli (12/05/2016). Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.18968203
URL https://dx.doi.org/10.24350/CIRM.V.18968203

Domain(s)

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2026

Give feedback