Results 161 to 170 of about 2,126 (197)

An optimization algorithm for maximum quasi-clique problem based on information feedback model. [PDF]

PeerJ Comput Sci
Liu S, Zhou J, Wang D, Zhang Z, Lei M.
europepmc   +1 more source

A 6D Object Pose Estimation Algorithm for Autonomous Docking with Improved Maximal Cliques. [PDF]

Sensors (Basel)
Han Z, Liu L.
europepmc   +1 more source

Exploring the prediction model and core genes for coronary artery disease in non-obese steatotic liver disease patients. [PDF]

Front Med (Lausanne)
Zhang Y, Song X, Han M, Gao X, Han S, Gao P.   +5 more
europepmc   +1 more source

Hyperlipidemia-associated specific modules and hub genes revealed by integrative methods of WGCNA and MetaDE. [PDF]

Front Genet
Zhao Z, Cao Y, Gu A, Yao H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Minimum Average Distance Clique Trees

SIAM Journal on Discrete Mathematics, 2015
Summary: Chordal graphs have been extensively studied and have applications in various fields, including computational biology, sparse matrix computation, and graphical models. They are characterized by the existence of clique trees, whose vertices correspond to the maximal cliques of a chordal graph.
Xu, Shou-Jun, Gysel, Rob, Gusfield, Dan
openaire   +2 more sources

Clique-transversal number of graphs whose clique-graphs are trees

Journal of Shanghai University (English Edition), 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Zuosong, Shan, Erfang
openaire   +2 more sources

Attributed tree matching and maximum weight cliques

Proceedings 10th International Conference on Image Analysis and Processing, 2003
A classical way of matching relational structures consists of finding a maximum clique in a derived "association graph". However it is not clear how to apply this approach to problems where the graphs are hierarchically organized, i.e., are trees, since maximum cliques are not constrained to preserve the partial order.
PELILLO, Marcello, SIDDIQI K, ZUCKER S. W.   +2 more
openaire   +2 more sources

Clique Tree Inequalities and the Symmetric Travelling Salesman Problem

Mathematics of Operations Research, 1986
The linear programming cutting plane approach for solving the travelling salesman problem has recently proven to be highly successful, cf. Crowder and Padberg (Crowder, H. P., M. W. Padberg. 1980. Solving large-scale symmetric travelling salesman problems to optimality. Management Sci. 26 495–509.), Grötschel (Grötschel, M. 1980a.
Grötschel, Martin, Pulleybank, William R.   +1 more
openaire   +2 more sources

Strong clique trees, neighborhood trees, and strongly chordal graphs

Journal of Graph Theory, 2000
A graph is a strongly chordal graph, if it is chordal and every cycle of even length at least six has a chord that divides the cycle into two odd-length paths. Whereas maximal complete subgraphs and clique trees are central objects in the theory of chordal grahps, a simple notion of strong clique trees allows to extend this structure to strongly ...
openaire   +2 more sources

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

International Journal of Foundations of Computer Science, 2020
The Steiner tree problem is one of the fundamental and classical problems in combinatorial optimization. In this paper we study this problem in the CONGESTED CLIQUE model (CCM) [29] of distributed computing. For the Steiner tree problem in the CCM, we consider that each vertex of the input graph is uniquely mapped to a processor and edges are ...
Parikshit Saikia, Sushanta Karmakar
openaire   +2 more sources