Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's (Q3887475)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's |
scientific article |
Statements
Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's (English)
0 references
1980
0 references
two-dimensional digraphs
0 references
completely bipartite composite
0 references
Baxter permutations
0 references
minimal series parallel graphs
0 references
syntactical graphs
0 references
depth- first search
0 references
two-dimensional graphs
0 references
forbidden subgraphs
0 references
graph recognition algorithms
0 references