A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
2015
Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient partition oracles. A partition oracle is a procedure that, given access to the inci...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI