Small Superpatterns for Dominance Drawing

DOI10.1137/1.9781611973204.9zbMath1429.68169arXiv1310.3770OpenAlexW2963768783MaRDI QIDQ5194761

William E. Devanny, David Eppstein, Michael J. Bannister

Publication date: 17 September 2019

Published in: 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.3770

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

The Parametric Closure Problem ⋮ Patterns in colored circular permutations ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Critical properties of bipartite permutation graphs ⋮ Unnamed Item

This page was built for publication: Small Superpatterns for Dominance Drawing