Algorithmic Aspects of the Maximum Colorful Arborescence Problem

DOI10.1007/978-3-319-55911-7_16zbMath1485.68181OpenAlexW2602050303MaRDI QIDQ2988823

Géraldine Jean, Julien Fradin, Guillaume Fertin

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Biochemistry, molecular biology (92C40) Signed and weighted graphs (05C22)

Related Items (6)

Precedence-constrained arborescences ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ Graph Motif Problems Parameterized by Dual ⋮ The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? ⋮ The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph ⋮ Heuristic Algorithms for the Maximum Colorful Subtree Problem

Uses Software

• speedy_colorful_subtrees

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity issues in vertex-colored graph pattern matching
• Which problems have strongly exponential complexity?
• Speedy Colorful Subtrees
• Graph Motif Problems Parameterized by Dual
• Parameterized Algorithms
• Research in Computational Molecular Biology

This page was built for publication: Algorithmic Aspects of the Maximum Colorful Arborescence Problem