Exact exponential algorithms to find tropical connected sets of minimum size
type: Item
instance of: scholarly article
title: Exact exponential algorithms to find tropical connected sets of minimum size
zbMATH Open document ID: 1369.05190
author: Mathieu Chapelle
author: Manfred Cochefert
author: Dieter Kratsch
author: Romain Letourneur
author: Mathieu Liedloff
published in: Theoretical Computer Science
publication date: 2017-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6714278
zbMATH Keywords: algorithms
zbMATH Keywords: exact exponential algorithms
zbMATH Keywords: colored graphs
Wikidata QID: Q115566734
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.03.003
OpenAlex ID: W2596652947
cites work: An exact algorithm for connected red-blue dominating set
cites work: On the Kernelization Complexity of Colorful Motifs
cites work: Connected tropical subgraphs in vertex-colored graphs
cites work: Improved approximation algorithm for convex recoloring of trees
cites work: Constrained multilinear detection and generalized graph motifs
cites work: Quadratic kernelization for convex recoloring of trees
cites work: Complexity issues in vertex-colored graph pattern matching
cites work: Finding approximate and constrained motifs in graphs
cites work: Upper and lower bounds for finding connected motifs in vertex-colored graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Finding and counting vertex-colored subtrees
cites work: On the complexity of \(k\)-SAT
cites work: Constrained multilinear detection for faster functional motif discovery
cites work: Triangulating Vertex-Colored Graphs
cites work: Convex recolorings of strings and trees: Definitions, hardness results and algorithms
cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
DOI: 10.1016/J.TCS.2017.03.003
description: scientific article; zbMATH DE number 6714278