An efficient algorithm for testing goal-minimality of graphs

DOI10.1016/j.dam.2013.02.017zbMath1287.05037OpenAlexW2051433924MaRDI QIDQ2446346

Štefan Gyürki, Ján Mazák

Publication date: 16 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.017

zbMATH Keywords

graph algorithmdistancediameteredge-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• GRAPE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Moore bound for irregular graphs
• Constructing goal-minimally \(k\)-diametric graphs by lifts
• Goal-minimally k-elongated graphs
• Finding a Minimum Circuit in a Graph
• The complexity of finding maximum disjoint paths with length constraints

This page was built for publication: An efficient algorithm for testing goal-minimality of graphs