On approximating the \(d\)-girth of a graph

DOI10.1016/j.dam.2013.04.022zbMath1285.05041MaRDI QIDQ2444552

David Peleg, Mordechai Shalom, Ignasi Sau

Publication date: 10 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.022

zbMATH Keywords

approximation algorithm; randomized algorithm; minimum degree; planar graph; hardness of approximation; generalized girth

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

68W20: Randomized algorithms

05C07: Vertex degrees