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

Random Generation and Enumeration of Bipartite Permutation Graphs

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

DOI10.1007/978-3-642-10631-6_111zbMath1272.05183OpenAlexW1520449176MaRDI QIDQ3652296

Toshiki Saitoh, Yota Otachi, Ryuhei Uehara, Katsuhisa Yamanaka

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_111


zbMATH Keywords

enumerationcountingDyck pathrandom generationbipartite permutation graphMotzkin path


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (2)

Random generation and enumeration of bipartite permutation graphs ⋮ Tractabilities and intractabilities on geometric intersection graphs







This page was built for publication: Random Generation and Enumeration of Bipartite Permutation Graphs

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