Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

Bartlomiej Dudek 0001, Pawel Gawrychowski. Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. In Yixin Cao 0001, Siu-Wing Cheng, Minming Li, editors, 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). Volume 181 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Authors

Bartlomiej Dudek 0001

This author has not been identified. Look up 'Bartlomiej Dudek 0001' in Google

Pawel Gawrychowski

This author has not been identified. Look up 'Pawel Gawrychowski' in Google