Finding the Boundary Nodes of a Euclidean Graph: Algorithms and Applications - Université de Bretagne Occidentale
Conference Papers Year : 2018

Finding the Boundary Nodes of a Euclidean Graph: Algorithms and Applications

Reinhardt Euler
Lab-STICC_UBO_CID_DECIDE
Ahcène Bounceur
Lab-STICC_UBO_CACS_MOCS
CV
Madani Bezoui
Université M'Hamed Bougara Boumerdes
CV

Domains

Discrete Mathematics [cs.DM] Networking and Internet Architecture [cs.NI]

Reinhardt Euler  : Connect in order to contact the contributor

https://hal.univ-brest.fr/hal-02500681

Submitted on : Friday, March 6, 2020-11:43:21 AM

Last modification on : Tuesday, August 27, 2024-12:51:36 PM

No file

Dates and versions

hal-02500681 , version 1 (06-03-2020)

Identifiers

  • HAL Id : hal-02500681 , version 1

Cite

Reinhardt Euler, Ahcène Bounceur, Madani Bezoui. Finding the Boundary Nodes of a Euclidean Graph: Algorithms and Applications. Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization (EURO/ALIO 2018), Jun 2018, Bologna, Italy. ⟨hal-02500681⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-BREST CNRS LAB-STICC_UBO ENIB LAB-STICC_ENIB LAB-STICC TDS-MACS IBNM
45 View
0 Download

Share

More