On approximating the $d$-girth of a graph

David Peleg; Ignasi Sau; Mordechai Shalom

doi:10.1016/j.dam.2013.04.022

Journal Articles Discrete Applied Mathematics Year : 2013

On approximating the $d$-girth of a graph

(1) , (2) , (3)

1
2
3

David Peleg

Function : Author

Weizmann Institute of Science [Rehovot, Israël]

Ignasi Sau

Function : Author
PersonId : 7331
IdHAL : ignasi-sau
ORCID : 0000-0002-8981-9287
IdRef : 137767420

Algorithmes, Graphes et Combinatoire

CV

Mordechai Shalom

Function : Author

Technion - Israel Institute of Technology [Haifa]

Keywords

Approximation algorithm Generalized girth Minimum degree Planar graph Randomized algorithm Hardness of approximation

Domains

Mathematics [math]

Ignasi Sau : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01272717

Submitted on : Thursday, February 11, 2016-12:04:06 PM

Last modification on : Wednesday, April 24, 2024-3:03:34 PM

Dates and versions

lirmm-01272717 , version 1 (11-02-2016)

Identifiers

HAL Id : lirmm-01272717 , version 1
DOI : 10.1016/j.dam.2013.04.022

Cite

David Peleg, Ignasi Sau, Mordechai Shalom. On approximating the $d$-girth of a graph. Discrete Applied Mathematics, 2013, 161 (16-17), pp.2587-2596. ⟨10.1016/j.dam.2013.04.022⟩. ⟨lirmm-01272717⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM MIPS UNIV-MONTPELLIER

121 View

0 Download

On approximating the $d$-girth of a graph

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share