Results 91 to 100 of about 1,615,193 (298)

The Burning Number of Directed Graphs: Bounds and Computational Complexity

Theory and Applications of Graphs, 2020
The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj   +1 more source

FastNano Liquid: An Automated Platform for Small‐Angle X‐ray Scattering‐Based Materials Discovery

Advanced Engineering Materials, EarlyView.
We present FastNano Liquid, an automated small‐ and wide‐angle X‐ray scattering platform for the combined synthesis and characterization of (nano)materials. The platform is coupled to varied reactor workflows for both in situ studies of reaction kinetics and ex situ screening of synthesis conditions to support machine learning‐guided exploration ...
Pierre‐Baptiste Flandrin, Émeline Cournède, Jens Krarup, Michael Lesa, Foyzul Hasan, Amandine Séné, Arnaud Lahouati, David Benhaiem, Jérémie‐Luc Sanchez, Simon Delacroix, Thierry Gacoin, Fabienne Testard, Damien Faivre, David Carriere, Corinne Chevallard, Olivier Taché, Mark A. Levenstein   +16 more
wiley   +1 more source

Parameterized Complexity of Untangling Knots

SIAM Journal on Computing
Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized complexity of this problem with respect to a natural parameter called defect.
Clément Legrand-Duchesne, Ashutosh Rai 0001, Martin Tancer   +2 more
openaire   +6 more sources

A Parameterized Complexity View on Collapsing k-Cores [PDF]

, 2019
We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining graph, that is, the (uniquely determined) largest induced subgraph with ...
Suchý, Ondrej, Molter, Hendrik, Luo, Junjie   +2 more
core   +1 more source

Control of Polarization and Polar Helicity in BiFeO3 by Epitaxial Strain and Interfacial Chemistry

Advanced Functional Materials, EarlyView.
In BiFeO3 thin films, the interplay of interfacial chemistry, electrostatics, and epitaxial strain is engineered to stabilize homohelicity in polarization textures at the domain scale. The synergistic use of a Bi2O2‐terminated Aurivillius buffer layer and a highly anisotropic compressive epitaxial strain offers new routes to control the polar‐texture ...
Elzbieta Gradauskaite, Lilia Huynh, Natascha Gray, Quintin N. Meier, Marta D. Rossell, Morgan Trassin   +5 more
wiley   +1 more source

Complexity and Approximability of Parameterized CSP

, 2016
The complexity of various Constraint Satisfaction Problems (CSP) when parameterized by structural measures (such as treewidth or clique-width) is a well-investigated area.
Mitsou, Valia
core   +1 more source

Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems

Tsinghua Science and Technology, 2014
We analyze a common feature of p-Kemeny AGGregation (p-KAGG) and p-One-Sided Crossing Minimization (p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community.
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh   +5 more
doaj   +1 more source

Treewidth-based algorithms for the small parsimony problem on networks

Algorithms for Molecular Biology, 2022
Background Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states
Celine Scornavacca, Mathias Weller
doaj   +1 more source

The Parameterized Complexity of Dependency Detection in Relational Databases [PDF]

, 2017
We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion ...
Schirneck, Martin, Bläsius, Thomas, Friedrich, Tobias   +2 more
core   +1 more source

Two‐Photon Grayscale Lithography (2GL) of High Mechanical and Optical Quality 3D Silica Glass Microstructures

Advanced Functional Materials, EarlyView.
Two‐photon grayscale lithography (2GL) enables high‐speed and precise 3D printing of thermolyzed silica glass microstructures with optical‐grade surface quality, high quality factors, and mechanical strength utilizing a custom‐made pre‐glass resist based on polyhedral oligomeric silsesquioxane (POSS) modified with a high‐sensitivity Norrish type II ...
Jonathan L. G. Schneider, Jiajie Liang, Paul Somers, Martin Wegener, Jens Bauer   +4 more
wiley   +1 more source