논문KCI 등재
A Method for Computing Upper Bounds on the Size of a Maximum Clique
대한수학회 (The Korean Mathematical Society)|2003.10|대한수학회논문집 (Communications of the KMS)|제18권 제4호|pp. 745-754
2
조회
0
다운로드
0
인용
0
참고문헌
주제분류수학
초록
Abstract
Maximum clique problem is to find a maximum clique (largest insize) in an undirected graph G. We present a method thatcomputes either a maximum clique or an upper bound for the size ofa maximum clique in G. We show that this method performs wellon certain class of graphs and discuss the application of thismethod in a branch and bound algorithm for solving maximum cliqueproblem, whose efficiency is depended on the computation of goodupper bounds.
관련 논문AI추천
On two graph partitioning questions노유미대한수학회 · 대한수학회지2005 · 제42권 제4호A Non-uniform Bound on Matching ProblemKaint Teerapabolarn, Kritsana Neammanee경북대학교 자연과학대학 수학과 · Kyungpook Mathematical Journal2006 · 제46권 제4호Bounding the Search Number of Graph ProductsGrace Power, Margaret-Ellen Messinger, Nancy Ellen Clarke경북대학교 자연과학대학 수학과 · Kyungpook Mathematical Journal2019 · 제59권 제1호Lower bounds of signed domination number of a graph손무영, 이재운, Young Soo Kwon대한수학회 · 대한수학회보2004 · 제41권 제1호Equivalence domination number of a treeM. Sundarakannan, S. Arumugam장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2012 · 제15권 제3호On the Basis Number of the Semi-Strong Product of Bipartite Graphs with CyclesMaref Y. Alzoubi, M. M. M. Jaradat경북대학교 자연과학대학 수학과 · Kyungpook Mathematical Journal2005 · 제45권 제1호
이 간행물의 다른 논문 (20건)
벡터 볼록 최적화 문제를 위한 벡터 변분부등식이규명pp. 587-602Nonvanishing of a plurigenus of a threefold of general typeDong-Kwan Shinpp. 603-613Semi-Primeness of the Endomorphism Ring of a Projective ModuleSoon-Sook Baepp. 615-620On fuzzy implicative filters of lattice implication algebrasQun Zhang, Yiquan Zhu, Eun Hwan Roh$pp. 621-628On rings containing a p-injective maximal left idealJin Yong Kim, Nam Kyun Kimpp. 629-633