DeepAI AI Chat

A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths

06/11/2019

∙

by Michael Cary, et al.

∙

West Virginia University

∙

∙

In this paper we present an algorithm for finding a minimum dominator coloring of orientations of paths. To date this is the first algorithm for dominator colorings of digraphs in any capacity. We prove that the algorithm always provides a minimum dominator coloring of an oriented path and show that it runs in O(n) time. The algorithm is available at <https://github.com/cat-astrophic/MDC-orientations_of_paths/>.

page 1

page 2

page 3

page 4

∙ 02/27/2023

3-Coloring in Time O(1.3217^n)

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n)....

0 Lucas Meijer, et al. ∙

∙ 04/02/2019

Oriented coloring on recursively defined digraphs

Coloring is one of the most famous problems in graph theory. The colorin...

0 Frank Gurski, et al. ∙

∙ 06/13/2022

Biologically Inspired Neural Path Finding

The human brain can be considered to be a graphical structure comprising...

0 Hang Li, et al. ∙

∙ 06/16/2019

Using Automatically Extracted Minimum Spans to Disentangle Coreference Evaluation from Boundary Detection

The common practice in coreference resolution is to identify and evaluat...

0 Nafise Sadat Moosavi, et al. ∙

∙ 09/06/2022

TAPA: A Scalable Task-Parallel Dataflow Programming Framework for Modern FPGAs with Co-Optimization of HLS and Physical Design

In this paper, we propose TAPA, an end-to-end framework that compiles a ...

0 Licheng Guo, et al. ∙

∙ 10/18/2017

Is the bump significant? An axion-search example

Many experiments in physics involve searching for a localized excess ove...

0 Frederik Beaujean, et al. ∙

∙ 11/21/2022

Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality

We propose quasi-stable coloring, an approximate version of stable color...

0 Moe Kayali, et al. ∙