Results 41 to 50 of about 123,539 (262)
Deciding first-order properties of nowhere dense graphs [PDF]
Nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of "sparse graphs" including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and graph classes
Courcelle B. +4 more
core +1 more source
Pharmacologic ascorbate (vitamin C) increases ROS, disrupts cellular metabolism, and induces DNA damage in CRPC cells. These effects sensitize tumors to PARP inhibition, producing synergistic growth suppression with olaparib in vitro and significantly delayed tumor progression in vivo. Pyruvate rescue confirms ROS‐dependent activity.
Nicolas Gordon +13 more
wiley +1 more source
MB-AGCL: multi-behavior adaptive graph contrast learning for recommendation
Graph Convolutional Networks (GCNs) have achieved remarkable success in recommendation systems by leveraging higher-order neighborhoods. In recent years, multi-behavior recommendation has addressed the challenges of data sparsity and cold start problems ...
Xiaowen lv +4 more
doaj +1 more source
Planar L-Drawings of Directed Graphs
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem.
A Garg +12 more
core +2 more sources
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
Representing Spatial Data with Graph Contrastive Learning
Large-scale geospatial data pave the way for geospatial machine learning algorithms, and a good representation is related to whether the machine learning model is effective.
Lanting Fang +3 more
doaj +1 more source
Planar graph augmentation problems [PDF]
In this paper we investigate the problem of adding a minimum number of edges to a planar graph in such a way that the resulting graph is biconnected and still planar. It is shown that this problem is NP-complete. We present an approximation algorithm for this planar biconnectivity augmentation problem that has performance ratio 3/2 and uses O(n2 log n)
Goos Kant, Hans L. Bodlaender
openaire +1 more source
Vertex Clustering of Augmented Graph Streams [PDF]
In this paper we propose a graph stream clustering algorithm with a unified similarity measure on both structural and attribute properties of vertices, with each attribute being treated as a vertex. Unlike others, our approach does not require an input parameter for the number of clusters, instead, it dynamically creates new sketch-based clusters and ...
McConville, Ryan +2 more
openaire +3 more sources
Cognitive Behavioral Therapy for Youth with Childhood‐Onset Lupus: A Randomized Clinical Trial
Objective Our objective was to determine the feasibility and acceptability of the Treatment and Education Approach for Childhood‐onset Lupus (TEACH), a six‐session cognitive behavioral intervention addressing depressive, fatigue, and pain symptoms, delivered remotely to individual youth with lupus by a trained interventionist.
Natoshia R. Cunningham +29 more
wiley +1 more source
Graph Augmentation for Recommendation [PDF]
Graph augmentation with contrastive learning has gained significant attention in the field of recommendation systems due to its ability to learn expressive user representations, even when labeled data is limited. However, directly applying existing GCL models to real-world recommendation environments poses challenges.
Zhang, Qianru +5 more
openaire +3 more sources

