On the minimum eccentricity isometric cycle problem

DOI10.1016/j.entcs.2019.08.015OpenAlexW2978341834WikidataQ113317417 ScholiaQ113317417MaRDI QIDQ2132344

Etienne Birmelé, Léo Planche, Fabien de Montgolfier

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.015

zbMATH Keywords

eccentricityisometric cycle\(k\)-domination\(k\)-covering

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• A linear time algorithm to compute a dominating path in an AT-free graph
• Characterization of graphs dominated by induced paths
• Finding the longest isometric cycle in a graph
• Graph minors. I. Excluding a forest
• On the minimum eccentricity shortest path problem
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• Dominating Pair Graphs

This page was built for publication: On the minimum eccentricity isometric cycle problem