{F}inding {A}ll {C}onvex {C}uts of a {P}lane {G}raph in {C}ubic {T}ime

R. Glantz; H. Meyerhenke

doi:10.1007/978-3-642-38233-8\_21

Publication

R. Glantz and H. Meyerhenke
Finding All Convex Cuts of a Plane Graph in Cubic Time
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, 2013
DOI, RIS, BibTex

Reference

@inproceedings{DBLP:conf/ciac/GlantzM13,
  author = "R. Glantz and H. Meyerhenke",
  title = "{F}inding {A}ll {C}onvex {C}uts of a {P}lane {G}raph in {C}ubic {T}ime",
  year = 2013,
  booktitle = "Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings",
  doi = "10.1007/978-3-642-38233-8\_21"
}