Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Priority queue sorting and labeled trees

From MaRDI portal
Publication:1400803
Jump to:navigation, search

DOI10.1007/S000260300004zbMath1035.68074OpenAlexW2004475442MaRDI QIDQ1400803

Angèle M. Hamel

Publication date: 14 August 2003

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000260300004


zbMATH Keywords

priority queuelabeled treesallowable pairs


Mathematics Subject Classification ID

Combinatorics in computer science (68R05)


Related Items (1)

Permuted composition tableaux, 0-Hecke algebra and labeled binary trees







This page was built for publication: Priority queue sorting and labeled trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1400803&oldid=13562253"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki