Cutting cycles of rods in space is FPT

04/07/2020
by   Mitchell Jones, et al.
0

In this short note, we show that cutting cycles of rods is fixed-parameter tractable by reducing the problem to computing a feedback vertex set in a mixed graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2020

Hitting Long Directed Cycles is Fixed-Parameter Tractable

In the Directed Long Cycle Hitting Set problem we are given a directed g...
research
02/17/2020

A Note on Arc-Disjoint Cycles in Bipartite Tournaments

We show that for each non-negative integer k, every bipartite tournament...
research
03/13/2019

A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories

We study the fabric spreading and cutting problem in apparel factories. ...
research
02/15/2012

The Good, the Bad, and the Odd: Cycles in Answer-Set Programs

Backdoors of answer-set programs are sets of atoms that represent clever...
research
01/22/2017

Perception-based energy functions in seam-cutting

Image stitching is challenging in consumer-level photography, due to ali...
research
07/26/2020

The Italian domination numbers of some products of directed cycles

An Italian dominating function on a digraph D with vertex set V(D) is de...
research
11/15/2019

General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences

We put forward new general criteria to design successor rules that gener...

Please sign up or login with your details

Forgot password? Click here to reset