The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph.

Eulerian digraphs and Dyck words, a bijection / P. Codara, O. D'Antona, M. Genuzio. ((Intervento presentato al 9. convegno GASCom tenutosi a Bertinoro, Italia nel 2014.

Eulerian digraphs and Dyck words, a bijection

P. Codara;O. D'Antona;M. Genuzio
2014

Abstract

The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph.
2014
Settore INF/01 - Informatica
http://arxiv.org/abs/1407.2461v1
Eulerian digraphs and Dyck words, a bijection / P. Codara, O. D'Antona, M. Genuzio. ((Intervento presentato al 9. convegno GASCom tenutosi a Bertinoro, Italia nel 2014.
Conference Object
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/237570
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact