Cutting Degree of Meanders - Artificial Intelligence Applications and Innovations - Part II (AIAI 2012) Access content directly
Conference Papers Year : 2012

Cutting Degree of Meanders

A. Panayotopoulos
  • Function : Author
  • PersonId : 1008249
University of Piraeus
Panayiotis Vlamos
  • Function : Author
  • PersonId : 1000689
Department of Informatics [Ionian University]

Abstract

We study the cutting problems of meanders using 2-Motzkin words. These words uniquely define elevated peakless Motzkin paths, which under specific conditions correspond to meanders. A procedure for the determination of the set of meanders with a given sequence of cutting degrees, or with a given cutting degree, is presented by using proper conditions.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
978-3-642-33412-2_49_Chapter.pdf (158.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://hal.science/hal-01523064

Submitted on : Tuesday, May 16, 2017-9:17:01 AM

Last modification on : Tuesday, May 24, 2022-5:10:02 PM

Long-term archiving on: Friday, August 18, 2017-12:22:03 AM

Download

Dates and versions

hal-01523064 , version 1 (16-05-2017)

Licence

Attribution

Identifiers

Cite

A. Panayotopoulos, Panayiotis Vlamos. Cutting Degree of Meanders. 8th International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2012, Halkidiki, Greece. pp.480-489, ⟨10.1007/978-3-642-33412-2_49⟩. ⟨hal-01523064⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP IFIP-AICT IFIP-TC IFIP-WG IFIP-TC12 IFIP-AIAI IFIP-WG12-5 IFIP-AICT-382
38 View
90 Download

Altmetric

Share

Gmail Facebook X LinkedIn More