Random generation and enumeration of bipartite permutation graphs (Q414425): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060809502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing isomorphism of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection between ordered trees and 2-Motzkin paths and its many consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple optimal representation for balanced parentheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of plane trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Generation and Enumeration of Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs / rank
 
Normal rank

Latest revision as of 05:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Random generation and enumeration of bipartite permutation graphs
scientific article

    Statements

    Random generation and enumeration of bipartite permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite permutation graph
    0 references
    counting
    0 references
    Dyck path
    0 references
    enumeration
    0 references
    Motzkin path
    0 references
    random generation
    0 references
    0 references