AI Chat AI Image Generator AI Video Text to Speech

The Almost-Disjoint 2-Path Decomposition Problem

07/10/2019

∙

by Annika Thome, et al.

∙

∙

We consider the problem of decomposing a given (di)graph into paths of length 2 with the additional restriction that no two such paths may have more than one vertex in common. We establish its NP-hardness by a reduction from 3-SAT, characterize (di)graph classes for which the problem can be be reduced to the Stable-set problem on claw-free graphs and describe a dynamic program for solving it for series-parallel digraphs.

Annika Thome
1 publication
Matthias Walter
13 publications

page 1

page 2

page 3

page 4

research

∙ 01/06/2020

(Theta, triangle)-free and (even hole, K_4)-free graphs. Part 2 : bounds on treewidth

A theta is a graph made of three internally vertex-disjoint chordless p...

0 Ni Luh Dewi Sintiari, et al. ∙

research

∙ 08/19/2020

Disjoint Shortest Paths with Congestion on DAGs

In the k-Disjoint Shortest Paths problem, a set of source terminal pairs...

0 Saeed Akhoondian Amiri, et al. ∙

research

∙ 03/05/2019

CPG graphs: Some structural and hardness results

In this paper we continue the systematic study of Contact graphs of Path...

0 Esther Galby, et al. ∙

research

∙ 11/14/2017

On edge intersection graphs of paths with 2 bends

An EPG-representation of a graph G is a collection of paths in a plane s...

0 Martin Pergel, et al. ∙

research

∙ 06/25/2020

Lifted Disjoint Paths with Application in Multiple Object Tracking

We present an extension to the disjoint paths problem in which additiona...

0 Andrea Hornakova, et al. ∙

research

∙ 04/19/2019

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths

A determinacy race occurs if two or more logically parallel instructions...

0 Rathish Das, et al. ∙

research

∙ 07/22/2021

A Cryptographic Hash Function from Markoff Triples

Cryptographic hash functions from expander graphs were proposed by Charl...

0 Elena Fuchs, et al. ∙