AI Chat AI Image Generator AI Video Text to Speech

Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours

01/16/2020

∙

by Ian Parberry, et al.

∙

∙

New algorithms for generating closed knight's tours are obtained by generating a vertex-disjoint cycle cover of the knight's graph and joining the resulting cycles. It is shown experimentally that these algorithms are significantly faster in practice than previous methods. A fast obfuscation algorithm for closed knight's tours that obscures obvious artifacts created by their method of generation is also given, along with visual and statistical evidence of its efficacy.

page 4

page 7

page 8

page 12

page 13

page 16

research

∙ 11/02/2017

Erdős-Pósa property of chordless cycles and its applications

A chordless cycle in a graph G is an induced subgraph of G which is a cy...

0 Eun Jung Kim, et al. ∙

research

∙ 11/10/2021

Generating faster algorithms for d-Path Vertex Cover

For a constant d, the d-Path Vertex Cover problem (d-PVC) is as follows:...

0 Radovan Červený, et al. ∙

research

∙ 07/01/2022

Packing cycles in planar and bounded-genus graphs

We devise constant-factor approximation algorithms for finding as many d...

0 Niklas Schlomberg, et al. ∙

research

∙ 08/07/2020

A 2^O(k)n algorithm for k-cycle in minor-closed graph families

Let 𝒞 be a proper minor-closed family of graphs. We present a randomized...

0 Raphael Yuster, et al. ∙

research

∙ 12/09/2018

Low Congestion Cycle Covers and their Applications

A cycle cover of a bridgeless graph G is a collection of simple cycles i...

0 Merav Parter, et al. ∙

research

∙ 03/10/2023

Simple and efficient four-cycle counting on sparse graphs

We consider the problem of counting 4-cycles (C_4) in a general undirect...

0 Paul Burkhardt, et al. ∙

research

∙ 04/24/2019

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering

Elegant and general algorithms for handling upwards-closed and downwards...

0 Jean Goubault-Larrecq, et al. ∙