Results 11 to 20 of about 2,827,443 (335)
Minimum-Weight Edge Discriminators in Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2014 In this paper we introduce the notion of minimum-weight edge-discriminators in hypergraphs, and study their various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathscr E)$, a function $\lambda: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\}$ is said to be an edge-discriminator on $\mathcal H$ if $\sum_{v\in E_i}{\lambda(v)}>0$, for all ...
Bhaswar B. Bhattacharya +2 more
core +7 more sources
Identifying Driver Genomic Alterations in Cancers by Searching Minimum-Weight, Mutually Exclusive Sets. [PDF]
PLoS Computational Biology, 2015 An important goal of cancer genomic research is to identify the driving pathways underlying disease mechanisms and the heterogeneity of cancers. It is well known that somatic genome alterations (SGAs) affecting the genes that encode the proteins within a
Songjian Lu +6 more
doaj +2 more sources
On a Linear Program for Minimum-Weight Triangulation [PDF]
SIAM Journal on Computing, 2014 Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or
Yousefi, Arman, Young, Neal E
core +8 more sources
Minimum-weight Cycle Covers and Their Approximability [PDF]
Discrete Applied Mathematics, 2006 To appear in the Proceedings of the 33rd Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007).
Bodo Manthey
openalex +6 more sources
BATMAN: Fast and Accurate Integration of Single-Cell RNA-Seq Datasets via Minimum-Weight Matching [PDF]
iScience, 2020 Summary: Single-cell RNA-sequencing (scRNA-seq) is a set of technologies used to profile gene expression at the level of individual cells. Although the throughput of scRNA-seq experiments is steadily growing in terms of the number of cells, large ...
Igor Mandric +4 more
doaj +2 more sources
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +3 more sources
Finding the Minimum-Weight k-Path [PDF]
, 2013 Given a weighted $n$-vertex graph $G$ with integer edge-weights taken from a range $[-M,M]$, we show that the minimum-weight simple path visiting $k$ vertices can be found in time $\tilde{O}(2^k \poly(k) M n^ ) = O^*(2^k M)$. If the weights are reals in $[1,M]$, we provide a $(1+\varepsilon)$-approximation which has a running time of $\tilde{O}(2^k ...
Liam Roditty +3 more
openaire +4 more sources
Minimum weight resolving sets of grid graphs [PDF]
, 2016 For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \in V$, we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \subseteq
Patrick Andersen +2 more
openalex +4 more sources
Pipelined correlated minimum weight perfect matching of the surface code [PDF]
Quantum, 2023 We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events.
Alexandru Paler, Austin G. Fowler
doaj +1 more source
Minimum weight design of truss structure via force method and Jaya algorithm” [PDF]
مهندسی مکانیک شریف, 2021 This research aims to minimize the weight of truss structures using force method formulation as a structural analyzer and Jaya algorithm as an optimizer tool.
A. Barzegari +2 more
doaj +1 more source