Using simulated annealing to construct extremal graphs
From MaRDI portal
Publication:5937924
DOI10.1016/S0012-365X(00)00265-XzbMath0977.05131WikidataQ128108676 ScholiaQ128108676MaRDI QIDQ5937924
Gerhard W. Dueck, S. MacMillan, Ping Wang
Publication date: 18 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)
Related Items (6)
Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ HSAGA and its application for the construction of near-Moore digraphs ⋮ New families of graphs without short cycles and large size ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ Constraints for symmetry breaking in graph representation
This page was built for publication: Using simulated annealing to construct extremal graphs