Computing maximum k-defective cliques in massive graphs
Year of publication: |
2021
|
---|---|
Authors: | Chen, Xiaoyu ; Zhou, Yi ; Hao, Jin-Kao ; Xiao, Mingyu |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 127.2021, p. 1-18
|
Subject: | Relaxed clique | Exact search | Branch-and-bound | Massive graphs | Graph reduction | Graphentheorie | Graph theory | Deskriptive Statistik | Descriptive statistics | Mathematische Optimierung | Mathematical programming |
-
A bipartite graph simplex method
Euler, Reinhardt, (2004)
-
Degeneracy Graphs and Simplex Cycling
Zörnig, Peter, (1991)
-
Inverse chromatic number problems in interval and permutation graphs
Chung, Yerim, (2015)
- More ...
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
Finding small feedback arc sets on large graphs
Xiong, Ziliang, (2024)
-
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
Lin, Weibo, (2019)
- More ...