|
Planar or almost planar graphs: topology to the rescue of algorithms| title | Planar or almost planar graphs: topology to the rescue of algorithms |
|---|
| start_date | 2024/11/05 |
|---|
| schedule | 10h-11h |
|---|
| online | no |
|---|
| location_info | salle S3 351, 3e étage |
|---|
| summary | Many graphs encountered in practice have a particular structure. For example, road networks have few or no intersections when drawn in a plane. We will see how this type of property interacts with the combinatorics of graphs, and often leads to the development of algorithms that are more efficient than in the general case. This will be an introductory talk focused on giving general principles and a toolbox for algorithm design on embedded graphs. |
|---|
| responsibles | Grandjean |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2024/11/06 16:06 UTC |
| |
|