Results 41 to 50 of about 564 (166)

List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph

SIAM Journal on Discrete Mathematics
Accepted manuscript; see DOI for journal ...
Hajebi, Sepehr, Li, Yanjia, Spirkl, Sophie   +2 more
openaire   +4 more sources

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Structure‐Aware Machine Learning for Polymers: A Hierarchical Graph Network for Predicting Properties From Statistical Ensembles

Macromolecular Rapid Communications, EarlyView.
This work presents a structure‐aware graph convolutional network that models polymers as statistical ensembles to predict macroscopic properties. By combining topologically realistic graphs generated via kinetic Monte Carlo simulations with explicit molar mass distributions, the framework achieves high accuracy in classifying architectures and ...
Julian Kimmig, Yannik Köster, Timo Koswig, Punith Raviswamy, Subhash V. S. Ganti, Stefan Zechel, Christopher Kuenneth, Ulrich S. Schubert   +7 more
wiley   +1 more source

Classifying the toxicity of pesticides to honey bees via support vector machines with random walk graph kernels

, 2022
Pesticides benefit agriculture by increasing crop yield, quality, and security. However, pesticides may inadvertently harm bees, which are valuable as pollinators. Thus, candidate pesticides in development pipelines must be assessed for toxicity to bees.
E. Adrian, Henle, Ping, Yang, Cory M., Simon, Xiaoli, Fern   +3 more
core   +1 more source

DeepSeek‐Lattice‐KG: A Compact Language Model With Knowledge Graph Augmentation for Lattice Structure Design

Materials Genome Engineering Advances, EarlyView.
DeepSeek‐Lattice‐KG integrates a domain‐adapted 14B LLM with a Neo4j lattice knowledge graph distilled from 50,000 papers. It analyzes queries, retrieves supporting subgraphs, and generates grounded answers; on a 2100‐question, six‐domain benchmark, it achieves 94.8% accuracy.
Zhiyang Shu, Chao Wang, Changsheng Feng, Feiyu Zhou, Xueyan Chen, Yan Chen, Yilun Liu   +6 more
wiley   +1 more source

A Comprehensive Multistage Average Controller for Trajectory Tracking in Solar‐Powered Mobile Robots: Analysis of Actuator‐Driver and Power Stage Integration

International Journal of Mechanical System Dynamics, EarlyView.
ABSTRACT This work addresses the challenge of bidirectional trajectory tracking in solar‐powered wheeled mobile robots (WMRs), considering the mechanical structure, actuator‐driver, and power stage subsystems. Notably, this is the first study to explicitly model and control the actuator‐driver subsystem within this context. The proposed solution relies
Benjamin Natanael Santiago‐Nogales, Julio Cesar Ordaz‐Dehesa, Ramón Silva‐Ortigoza, Erik Reyes‐Reyes, J. Martín Alba‐Martínez, Juan Eduardo Velázquez‐Velázquez, José Rafael García‐Sánchez, Magdalena Marciano‐Melchor, Hind Taud   +8 more
wiley   +1 more source

Listing all maximal cliques in sparse graphs in near-optimal time [PDF]

, 2011
The degeneracy of an $n$-vertex graph $G$ is the smallest number $d$ such that every subgraph of $G$ contains a vertex of degree at most $d$. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal ...
Löffler, Maarten, Strash, Darren, Eppstein, David   +2 more
core   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source

Interdiction Models and Heuristics for Graph Propagation

Networks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

Generalizing the Gaussian Network Model: Spanning‐Tree Thermodynamics Shows Entropy‐Driven KRAS Activation

Proteins: Structure, Function, and Bioinformatics, EarlyView.
ABSTRACT The GTPase KRAS executes a conformational switch between a GTP‐bound active state and a GDP‐bound inactive state, a process central to oncogenic signaling. However, the structural basis of this switching at the level of residue‐contact organization remains incompletely characterized by traditional binary structural models.
Fatma Senguler Ciftci, Burak Erman
wiley   +1 more source