Cliques with maximum/minimum edge neighborhood and neighborhood density
From MaRDI portal
Publication:1762007
DOI10.1016/J.COR.2011.04.016zbMATH Open1250.05084OpenAlexW2048753002MaRDI QIDQ1762007FDOQ1762007
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
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast algorithm for the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- New methods to color the vertices of a graph
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Extended and discretized formulations for the maximum clique problem
- Variable neighborhood search for the maximum clique
- Isolation concepts for efficiently enumerating dense subgraphs
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A Convex Quadratic Characterization of the Lovász Theta Number
- Optimal Protein Structure Alignment Using Maximum Cliques
- Algorithms – ESA 2005
- Web document clustering using hyperlink structures
- Enumeration of isolated cliques and pseudo-cliques
- Enumerating Isolated Cliques in Synthetic and Financial Networks
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- A multi-KP modeling for the maximum-clique problem
Cited In (6)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Communication cliques in mobile phone calling networks
- Complexity and heuristics for the weighted max cut‐clique problem
- Many cliques with few edges and bounded maximum degree
- Maximum cut-clique problem: ILS heuristics and a data analysis application
- A review on algorithms for maximum clique problems
Uses Software
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)
