Results 41 to 50 of about 561,904 (322)
Search Algorithms and Applications [PDF]
Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or
core +1 more source
Optimal Padded Decomposition For Bounded Treewidth Graphs [PDF]
A $(β,δ,Δ)$-padded decomposition of an edge-weighted graph $G = (V,E,w)$ is a stochastic decomposition into clusters of diameter at most $Δ$ such that for every vertex $v\in V$, the probability that $\rm{ball}_G(v,γΔ)$ is entirely contained in the ...
Arnold Filtser +6 more
doaj +1 more source
ADVANCED DATA STRUCTURES AND ALGORITHMS
<p>ADVANCED DATA STRUCTURES AND ALGORITHMS</p ...
Prof. Sanjay Agal
core +1 more source
Approximating optimization problems in graphs with locational uncertainty [PDF]
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any position in
Marin Bougeret +2 more
doaj +1 more source
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth [PDF]
Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$.
Zongwen Bai, Jianhua Tu, Yongtang Shi
doaj +1 more source
Editorial:Special issue on data compression algorithms and their applications
This Special Issue of Algorithms is focused on data compression algorithms and their applications.
Bille, Philip, Philip Bille
core +1 more source
Special Issue on Algorithms and Data-Structures for Compressed Computation [PDF]
As the production of massive data has outpaced Moore’s law in many scientific areas, the very notion of algorithms is transforming [...
Prezza N. +3 more
core +1 more source
Composing dynamic programming tree-decomposition-based algorithms [PDF]
Given two integers $\ell$ and $p$ as well as $\ell$ graph classes $\mathcal{H}_1,\ldots,\mathcal{H}_\ell$, the problems $\mathsf{GraphPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell,p)$, \break $\mathsf{VertPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell ...
Julien Baste
doaj +1 more source
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Design of data structures for terrain reference navigation [PDF]
This thesis describes the design of a data structure for use with Digitised Terrain Elevation Data (DTED) in Terrain Reference Navigation (TRN) systems.
Gia, M. C., Gia, M
core

