Using simulated annealing to construct extremal graphs

DOI10.1016/S0012-365X(00)00265-XMaRDI QIDQ5937924zbMATH OpenWikidataFDO

Authors Ping Wang, G. W. Dueck, S. MacMillan

Publication date 18 July 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00265-X

zbMATH Keywords

degree distributionextremal graphsgirthshortest cyclesimulated annealing

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Calculating the extremal number
• Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
• scientific article; zbMATH DE number 861311
• On extremal graphs with bounded girth
• scientific article; zbMATH DE number 5989950

Cited in

(10)

• Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
• Constraints for symmetry breaking in graph representation
• Calculating the extremal number
• scientific article; zbMATH DE number 3978858 (Why is no real title available?)
• Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
• Graph minors from simulated annealing for annealing machines with sparse connectivity
• Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
• SAT modulo symmetries for graph generation and enumeration
• New families of graphs without short cycles and large size
• HSAGA and its application for the construction of near-Moore digraphs

This page was built for publication: Using simulated annealing to construct extremal graphs

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