scientific article
From MaRDI portal
Publication:2928582
zbMath1301.05092MaRDI QIDQ2928582
Igor da Fonseca Ramos, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter
Publication date: 10 November 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2531/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
And/or-convexity: a graph convexity based on processes and deadlock models ⋮ Convex Independence in Permutation Graphs
This page was built for publication:
