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