Enumerating minimal solution sets for metric graph problems

DOI10.1007/S00453-025-01300-4MaRDI QIDQ6980433zbMATH OpenFDO

Authors Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney

Publication date 22 May 2025

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

metric dimensionmatroidsstrong metric dimensionhypergraph dualizationresolving setsalgorithmic enumerationgeodetic sets

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Hypergraphs (05C65) Parameterized complexity, tractability and kernelization (68Q27) Metric embeddings as related to computational problems and algorithms (68R12)

This page was built for publication: Enumerating minimal solution sets for metric graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6980433)