Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's

DOI10.1007/BF00978163zbMath0444.05020MaRDI QIDQ3887475

Johnson Murdoch Hart

Publication date: 1980

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

forbidden subgraphsBaxter permutationsgraph recognition algorithmsdepth- first searchtwo-dimensional graphscompletely bipartite compositesyntactical graphstwo-dimensional digraphsminimal series parallel graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Subclasses of Baxter Permutations Based on Pattern Avoidance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of Baxter permutations
• Enumerating syntactical graphs and lattices of derivations
• Derivation languages and syntactical categories
• On Fixed Points of the Composite of Commuting Functions

This page was built for publication: Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's