In particular, the colouring of planar graphs—those which can be depicted on a plane without edge intersections—has attracted sustained attention due to its combinatorial complexity and ...

Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in ...

Abstract: Graph-based methods have demonstrated strong performance in multi-view clustering (MVC) due to their capability to capture complex data structures. Among these, discrete spectral embedding ...

First, the path is described using discrete path points. The proposed algorithm utilizes the fast Fourier transform (FFT) to process this data, enabling the construction of a nonsingular guiding ...

Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China Xingzhi College, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R ...

Discrete Mathematics, Algorithms and Applications Vol. 15, No. 07, 2250152 (2023) Research Paper No Access On the dominant local metric dimension of some planar graphs ...

This repository includes academic notes, study materials, and resources from B.Tech (Hons) in CSE, specializing in Artificial Intelligence and Data Science. It features question papers, proprietary ...