Publication

Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition

Dominique de Werra
2018
Conference Papers

Abstract

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. We also present the first constructive polynomial-time algorithm for the recognition of 3-letter graphs.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition

Chat with Graph Search

Metastability of the Potts Ferromagnet on Random Regular Graphs

Recoloring subgraphs of K-2n for sports scheduling

Letter graphs and geometric grid classes of permutations: Characterization and recognition