Results 61 to 70 of about 2,616,817 (282)
A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified root edge ...
David Eppstein +2 more
doaj +1 more source
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
We studydependency quantified Boolean formulas(DQBF),an extension of QBF in which dependencies of existentialvariables are listed explicitly rather than being implicit inthe order of quantifiers. DQBF evaluation is a canonicalNEXPTIME-complete problem, a
Robert Ganian +7 more
core +1 more source
ABSTRACT Multisystemic smooth muscle dysfunction syndrome (MSMDS) is an ultra‐rare, ACTA2‐related disorder characterized by severe cerebrovascular disease, aortic aneurysms, and smooth muscle dysfunction. Using molecular dynamics simulations and in silico drug screening, we identified that sapropterin dihydrochloride (Kuvan) is a candidate capable of ...
Moran Hausman‐Kedem +9 more
wiley +1 more source
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
Special Issue on Graph Algorithms
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj +1 more source
Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Structure of conflict graphs in constraint alignment problems and algorithms [PDF]
We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs $G_1=(V_1,E_1), G_2=(V_2,E_2)$, a pair of vertex mappings induces an {\it edge conservation} if the vertex pairs are ...
Ferhat Alkan +3 more
doaj +1 more source
Finding topological subgraphs is fixed-parameter tractable [PDF]
We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that topological subgraph testing is fixed-parameter tractable, resolving a longstanding open question of Downey and ...
Martin Grohe +3 more
openaire +3 more sources
The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling +15 more
wiley +1 more source
CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz +4 more
wiley +1 more source

