Maximum common subgraph: some upper bound and lower bound results

被引：0

作者：

Xiuzhen Huang

Jing Lai

Steven F Jennings

机构：

[1] Arkansas State University,Department of Computer Science

[2] State University,Department of Applied Science

[3] University of Arkansas at Little Rock,Department of Information Science

[4] University of Arkansas at Little Rock,undefined

来源：

BMC Bioinformatics | / 7卷

关键词：

Parameterized Computation; Vertex Cover; Maximum Clique; Recursive Function; Longe Common Subsequence;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[31] New upper bound for the chromatic number of a random subgraph of a distance graph
Gusev, A. S.
MATHEMATICAL NOTES, 2015, 97 (3-4) : 326 - 332
[32] AN UPPER BOUND FOR SOME RAMSEY NUMBERS
THOMASON, A
JOURNAL OF GRAPH THEORY, 1988, 12 (04) : 509 - 517
[33] UPPER AND LOWER BOUND RESULTS ON THE CONVEX-HULL OF INTEGER POINTS IN POLYHEDRA
MORGAN, DA
MATHEMATIKA, 1991, 38 (76) : 321 - 328
[34] Some properties of an upper bound for mu
Meinsma, G
Shrivastava, Y
Fu, MY
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (09) : 1326 - 1330
[35] New Upper Bound and Lower Bound for Degree-Based Network Entropy
Lu, Guoxiang
Li, Bingqing
Wang, Lijia
SYMMETRY-BASEL, 2016, 8 (02):
[36] Generalized Common Fixed Point Results via Greatest Lower Bound Property
Kutbi, Marwan Amin
Ahmad, Jamshaid
Azam, Akbar
Al-Rawashdeh, Ahmed Saleh
JOURNAL OF APPLIED MATHEMATICS, 2014,
[37] Approximating the maximum size of a k-regular induced subgraph by an upper bound on the co-k-plex number
C. J. Luz
Journal of Mathematical Sciences, 2012, 182 (2) : 216 - 226
[38] Functional area lower bound and upper bound on multicomponent selection for interval scheduling
Shen, ZX
Jong, CC
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (07) : 745 - 759
[39] A LOWER BOUND FOR SOME FLUTTER LOADS
LY, BL
JOURNAL OF SOUND AND VIBRATION, 1989, 129 (03) : 523 - 525
[40] Some exact union bound results for maximum likelihood detection in MIMO systems
Lindell, G
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 2223 - 2227

← 1 2 3 4 5 →