Results 81 to 90 of about 116,308 (181)

Regular Kn-free graphs

Journal of Combinatorial Theory, Series B, 1983
AbstractTriples (p, n, r) for which there exists an r-regular Kn-free graph on p points are determined.
openaire   +1 more source

An Overview of Co-Clustering via Matrix Factorization

IEEE Access, 2019
Co-clustering algorithms have been widely used for text clustering and gene expression through matrix factorization. In recent years, diverse co-clustering algorithms which group data points and features synchronously have shown their advantages over ...
Renjie Lin, Shiping Wang, Wenzhong Guo
doaj   +1 more source

Regular packings of regular graphs

Discrete Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutiérrez, A., Lladó, A.S.
openaire   +2 more sources

Regular graphs with regular neighborhoods [PDF]

Glasgow Mathematical Journal, 1992
The existence of r-regular graphs such that each edge lies in exactly t triangles, for given integers t < r, is studied. If t is sufficiently close to r then each such connected graph has to be the complete multipartite graph. Relations to graphs with isomorphic neighborhoods are also considered.
openaire   +2 more sources

Regular Factors of Regular Graphs from Eigenvalues [PDF]

The Electronic Journal of Combinatorics, 2010
Let $r$ and $m$ be two integers such that $r\geq m$. Let $H$ be a graph with order $|H|$, size $e$ and maximum degree $r$ such that $2e\geq |H|r-m$. We find a best lower bound on spectral radius of graph $H$ in terms of $m$ and $r$. Let $G$ be a connected $r$-regular graph of order $|G|$ and $ k < r$ be an integer.
openaire   +3 more sources

Regular character degree graphs

Journal of Algebra, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A topological reconstruction method for building point clouds integrating deep semantic segmentation and adjacency constraints

Geocarto International
To address challenges in urban building digitization, such as data redundancy, structural ambiguity, and boundary inaccuracy, this paper proposes a topological reconstruction method integrating deep semantic segmentation and adjacency constraints ...
Ruihan Yao, Weibo Zeng, Qingxiang Chen, Boya Wang, Qi Lu, Shanshan Liang   +5 more
doaj   +1 more source

EC-PGMGR: Ensemble Clustering Based on Probability Graphical Model With Graph Regularization for Single-Cell RNA-seq Data. [PDF]

Front Genet, 2020
Zhu Y, Zhang DX, Zhang XF, Yi M, Ou-Yang L, Wu M.   +5 more
europepmc   +1 more source

GReAT: A Graph Regularized Adversarial Training Method

IEEE Access
This paper presents GReAT (Graph Regularized Adversarial Training), a novel regularization method designed to enhance the robust classification performance of deep learning models.
Samet Bayram, Kenneth Barner
doaj   +1 more source

Blind Remote Sensing Image Deblurring Based on Local Maximum High-Frequency Coefficient Prior and Graph Regularization

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
In satellite remote sensing imaging, factors such as optical axis shift, image plane jitter, movement of the target object, and Earth's rotation can induce image blur.
Zhidan Cai, Ming Fang, Zhe Li, Jinyi Ming, Huimin Wang   +4 more
doaj   +1 more source