A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications - Archive ouverte HAL
Conference Papers Year : 2018

A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications

Colin de La Higuera
Laboratoire des Sciences du Numérique de Nantes
Tatsuya Akutsu
  • Function : Author
Bioinformatics Center
Takayuki Tamura
  • Function : Author
Bioinformatics Center

Domains

Computational Complexity [cs.CC]

Colin De la Higuera  : Connect in order to contact the contributor

https://hal.science/hal-02006824

Submitted on : Monday, February 4, 2019-7:48:23 PM

Last modification on : Tuesday, August 27, 2024-12:49:56 PM

No file

Dates and versions

hal-02006824 , version 1 (04-02-2019)

Identifiers

  • HAL Id : hal-02006824 , version 1

Cite

Colin de La Higuera, Tatsuya Akutsu, Takayuki Tamura. A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018, Dagstuhl, Germany. ⟨hal-02006824⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-NANTES CNRS EC-NANTES UNAM LS2N LS2N-TALN NANTES-UNIVERSITE
51 View
0 Download

Share

More