19-25 June 2011
Bled, Slovenia
Europe/Ljubljana timezone
Home > Timetable > Contribution details
PDF | XML

Graphs within graphs -- an algorithmic look at containment relations

Presented by Dr. Marcin KAMIńSKI
Type: Oral presentation
Track: Algorithmic Graph Theory

Content

How fast can one test whether a graph is contained in another? We will survey known algorithmic results on deciding containment relations in graphs with a focus on (induced) subgraphs, (induced) minors, and contractions.

Place

Location: Bled, Slovenia
Address: Best Western Hotel Kompas Bled

Primary authors

More