Cliques with maximum/minimum edge neighborhood and neighborhood density

DOI10.1016/J.COR.2011.04.016zbMATH Open1250.05084OpenAlexW2048753002MaRDI QIDQ1762007FDOQ1762007

Authors Xianqiang Yang 

Publication date 15 November 2012

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.04.016

zbMATH Keywords

extended formulationsmaximum clique problemclique edge neighborhooddiscretized formulations

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The maximum number of cliques in dense graphs
• Cliques in graphs with bounded minimum degree
• Cliques in graphs with bounded minimum degree
• Density of graphs in which each edge is contained in at least two maximal cliques
• Many cliques with few edges and bounded maximum degree
• On the maximum number of cliques in a graph
• On cliques in graphs
• Cliques in \(k\)-connected graphs
• Maximal clique enumeration in finding near neighbourhoods
• scientific article; zbMATH DE number 975336

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A Convex Quadratic Characterization of the Lovász Theta Number
• A fast algorithm for the maximum clique problem
• A multi-KP modeling for the maximum-clique problem
• A sequential elimination algorithm for computing bounds on the clique number of a graph
• Algorithms – ESA 2005
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Clique-detection models in computational biochemistry and genomics
• Enumerating Isolated Cliques in Synthetic and Financial Networks
• Enumeration of isolated cliques and pseudo-cliques
• Extended and discretized formulations for the maximum clique problem
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Isolation concepts for efficiently enumerating dense subgraphs
• New methods to color the vertices of a graph
• Optimal Protein Structure Alignment Using Maximum Cliques
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Variable neighborhood search for the maximum clique
• Web document clustering using hyperlink structures

Cited in

(6)

• Communication cliques in mobile phone calling networks
• Many cliques with few edges and bounded maximum degree
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
• Maximum cut-clique problem: ILS heuristics and a data analysis application
• Complexity and heuristics for the weighted max cut‐clique problem
• A review on algorithms for maximum clique problems

Describes a project that uses

Uses Software

• KEGG
• MCODE

This page was built for publication: Cliques with maximum/minimum edge neighborhood and neighborhood density

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