Minimum k‐cores and the k‐core polytope

DOI10.1002/net.22081OpenAlexW3208962197MaRDI QIDQ6087566

Illya V. Hicks, Unnamed Author

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22081

zbMATH Keywords

valid inequalitiesbranch-and-cutfeedback vertex setbinary integer program\(k\)-core heuristicsminimum \(k\)-core problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimal \(k\)-core problem for modeling \(k\)-assemblies
• Parameterized complexity of finding small degree-constrained subgraphs
• On the approximability of some degree-constrained subgraph problems
• Subgraphs of minimal degree \(k\)
• Maximum matchings in regular graphs of high girth
• Long cycles in graphs with no subgraphs of minimal degree 3
• On associative memory
• Towards a theory of cell assemblies
• Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
• On clique relaxation models in network analysis
• On approximating the \(d\)-girth of a graph
• Clique-detection models in computational biochemistry and genomics
• Smallest-last ordering and clustering and graph coloring algorithms
• A Greedy Heuristic for the Set-Covering Problem

This page was built for publication: Minimum k‐cores and the k‐core polytope