-free graphs via shrinking the space of induced paths.

Marcin Pilipczuk Michal Pilipczuk Pawel Rzazewski

Published in: SOSA (2021)

Keyphrases

space time
graph matching
case study
higher dimensional
path finding
information retrieval
decision trees
data structure
search space
shortest path
graph theoretic
labeled graphs