Random Generation and Enumeration of Bipartite Permutation Graphs

DOI10.1007/978-3-642-10631-6_111MaRDI QIDQ3652296zbMATH OpenOpenAlexFDO

Authors Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara

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

bipartite permutation graphcountingDyck pathenumerationMotzkin pathrandom generation

Mathematics Subject Classification ID

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

Recommendations

• Random generation and enumeration of bipartite permutation graphs
• scientific article; zbMATH DE number 1896992
• The genus of a random bipartite graph
• Random bipartite graphs
• Bipartite permutation graphs
• Random Generation and Enumeration of Proper Interval Graphs
• Random permutation graphs and related Markov chains
• Random graphs with a random bijection
• The number of components of a random bipartite graph
• Degree sequence of random permutation graphs

Cited in

(5)

• Permutations generated by token passing in graphs
• Tractabilities and intractabilities on geometric intersection graphs
• Random Generation and Enumeration of Proper Interval Graphs
• Random generation and enumeration of bipartite permutation graphs
• scientific article; zbMATH DE number 1334601 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652296)