On approximating the $d$-girth of a graph

Journal article

Open access

Peer reviewed

David Peleg, Ignasi Sau and Mordechai Shalom

Discrete Applied Mathematics, Vol.161(16-17), pp.2587-2596

11/2013

Abstract

Approximation algorithm

Generalized girth

Minimum degree

Planar graph

Randomized algorithm

Hardness of approximation

url

Find in HALView

url

https://doi.org/10.1016/j.dam.2013.04.022View

Published (Version of record) Open

1 Record Views

Title: On approximating the $d$-girth of a graph
Creators - without role: David Peleg - Weizmann Institute of Science
Ignasi Sau - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Mordechai Shalom - Tel Hai Academic College
Publication Details: Discrete Applied Mathematics, Vol.161(16-17), pp.2587-2596
Identifiers: 9943257709311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01272717