Results 41 to 50 of about 4,614 (253)
Bounded fixed-parameter tractability and reducibility
Annals of Pure and Applied Logic, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rod Downey +3 more
openaire +2 more sources
FEBS Open Bio, EarlyView.Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty +13 more
wiley +1 more source
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann +2 more
doaj +1 more source
EURASIP Journal on Wireless Communications and Networking, 2021 The energy cost minimization for mission-critical internet-of-things (IoT) in mobile edge computing (MEC) system is investigated in this work. Therein, short data packets are transmitted between the IoT devices and the access points (APs) to reduce ...
Yaru Fu +6 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.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
The Parameterized Complexity of the Rainbow Subgraph Problem
Algorithms, 2015 The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner +3 more
doaj +1 more source
On the Fixed-Parameter Tractability of Capacitated Clustering
CoRR, 2019 We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best known approximation bound for high dimensional Euclidean space and general metric space is $Θ(\log k)$ and it remains a major open problem whether a constant factor exists ...
Cohen-Addad, Vincent, Li, Jason
openaire +5 more sources
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2012 The MULTICUT problem, given a graph G, a set of terminal pairs T={(s_i,t_i) | 1 <= i <= r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal vertices that separates all the terminal pairs, i.e., after removing the cutset, t_i is not reachable from s_i for each 1 <= i <= r.
Stefan Kratsch +3 more
openaire +7 more sources
Advanced Engineering Materials, EarlyView.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
Journal of Graph Algorithms and Applications, 2017 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