Computing Graph Hyperbolicity Using Dominating Sets

Coudert, David; Nusser, André; Viennot, Laurent

doi:10.1137/1.9781611977042.7

Local TagsRelease HistoryDetailsSummary

Computing Graph Hyperbolicity Using Dominating Sets

Coudert, D., Nusser, A., & Viennot, L. (2022). Computing Graph Hyperbolicity Using Dominating Sets. In C. A. Phillips, & B. Speckman (Eds.), Proceedings of the Symposium on Algorithm Engineering and Experiments (pp. 78-90). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977042.7.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000C-268E-A Version Permalink: https://hdl.handle.net/21.11116/0000-000C-268F-9

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Coudert, David¹, Author
Nusser, André², Author
Viennot, Laurent¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2022

Publication Status: Published online

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Coudert_ALENEX22
DOI: 10.1137/1.9781611977042.7

Degree: -

Event

show

hide

Title: Symposium on Algorithm Engineering and Experiments

Place of Event: Alexandria, VA, USA

Start-/End Date: 2022-01-09 - 2022-01-10

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the Symposium on Algorithm Engineering and Experiments

Abbreviation : ALENEX 2022

Source Genre: Proceedings

Creator(s):
Phillips, Cynthia A.¹, Editor
Speckman, Bettina¹, Editor

Affiliations:
1 External Organizations, ou_persistent22

Publ. Info: Philadelphia, PA : SIAM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 78 - 90 Identifier: ISBN: 978-1-61197-704-2