Results 161 to 170 of about 5,334 (178)

EMCM: A Novel Binary Edge-Feature-Based Maximum Clique Framework for Multispectral Image Matching

open access: yesRemote Sensing, 2019
Seeking reliable correspondence between multispectral images is a fundamental and important task in computer vision. To overcome the nonlinearity problem occurring in multispectral image matching, a novel, edge-feature-based maximum clique-matching frame
Bin Fang, Kun Yu, Pei An
exaly   +2 more sources

A note on clique immersion of strong product graphs

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chuanshu Wu, Zijian Deng
openaire   +2 more sources

Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Graphs with Large Clique Number

Journal of Interconnection Networks
The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] rainbow vertex connected. The proper strong rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text],
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
openaire   +1 more source

The value of strong inapproximability results for clique

Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
openaire   +1 more source

SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem

Artificial Intelligence, 2020
Yiyuan Wang, Shaowei Cai, Minghao Yin
exaly  

Structural Parameterizations of Clique Coloring

Algorithmica, 2021
Lars Jaffke   +2 more
exaly  

Clique number of the square of a line graph

Discrete Mathematics, 2016
Małgorzata Śleszyńska-Nowak
exaly  

Home - About - Disclaimer - Privacy