Minimum number of below average triangles in a weighted complete graph

DOI10.1016/J.DISOPT.2006.05.004MaRDI QIDQ2465935zbMATH OpenOpenAlexFDO

Authors Gareth Bendall, François Margot

Publication date 11 January 2008

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2006.05.004

zbMATH Keywords

\(k\)-cliqueaverage dominating algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Lower bounds on the number of triangles in a graph
• The minimal density of triangles in tripartite graphs
• scientific article; zbMATH DE number 889952
• The effect of edge weights on clique weights
• Cycles in weighted graphs

Cites work

• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Local search and the local structure of NP-complete problems
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
• TSP heuristics: domination analysis and complexity
• TSP tour domination and Hamilton cycle decompositions of regular digraphs
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
• When the greedy algorithm fails

Cited in

(2)

• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
• scientific article; zbMATH DE number 2197896 (Why is no real title available?)

This page was built for publication: Minimum number of below average triangles in a weighted complete graph

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