Abstract: Graph-structured combinatorial problems in complex networks are prevalent in many domains, and are computationally demanding due to their complexity and non-linear nature. Traditional ...

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

Readers Edition. This is the (nearly) annual tradition of you, RPS readers, telling us where we went wrong in our annual ...

Each line segment of a distance-time graph represents one part of a journey. A distance-time graph, sometimes referred to as a travel graph, is a way of representing a journey. It is helpful to have ...

Abstract: This work presents an estimator-based distributed preset-time algorithm that effectively addresses the equality-constrained optimization problem on directed graphs (digraphs). Initially, we ...

This repo hosts the code for paper "Nonlinear Locality-Preserving Projections With Dynamic Graph Learning, in TNNLS-2025". The proposed method addresses two main limitations: first, the pre-designed ...

Welcome to What’s On, our weekly roundup of notable shows and films. Here is what’s happening on TV from Sunday, December 28 to Saturday, January 3. All times are Eastern.