Distance-based (and path-based) covering problems for graphs of given cyclomatic number

Documenti analoghi

• Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2025)
• Algorithms and hardness for Metric Dimension on digraphs
  di: Dailly, Antoine, et al.
  Pubblicazione: (2023)
• Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2024)
• Isometric path complexity of graphs
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2022)
• Progress towards the two-thirds conjecture on locating-total dominating sets
  di: Chakraborty, Dipayan, et al.
  Pubblicazione: (2022)