Obtaining Optimalk-Cardinality Trees Fast

DOI10.1137/1.9781611972887.3zbMath1427.68352OpenAlexW2175777920MaRDI QIDQ5233508

Markus Chimani, Maria Kandyba, Petra Mutzel, Ivana Ljubić

Publication date: 11 September 2019

Published in: 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972887.3

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (4)

Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem ⋮ Models of random subtrees of a graph ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems

This page was built for publication: Obtaining Optimalk-Cardinality Trees Fast