Algorithms - ESA 2003
From MaRDI portal
Publication:5897291
DOI10.1007/b13632zbMath1266.05169OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897291
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
planar drawingbiconnected planar graphbipartite graphset of facesset of verticesvertex face incidence
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Improved bounds on the planar branchwidth with respect to the largest grid minor size, Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs, On triangulating \(k\)-outerplanar graphs, Computational study on a PTAS for planar dominating set problem, Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
