Results 11 to 20 of about 4,819,979 (323)
Land Cover and Crop Classification Based on Red Edge Indices Features of GF-6 WFV Time Series Data
Remote Sensing, 2021 Time series of vegetation indices can be utilized to capture crop phenology information, and have been widely used in land cover and crop classification, phenological feature extraction, and planting structure monitoring.
Yupeng Kang +6 more
doaj +2 more sources
Belief propagation for optimal edge cover in the random complete graph [PDF]
arXiv.org, 2014 We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs.
Khandwawala, Mustafa, Sundaresan, Rajesh
core +2 more sources
New Bounds for Edge-Cover by Random Walk [PDF]
Combinatorics, probability & computing, 2011 We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$.
AGELOS GEORGAKOPOULOS +7 more
core +2 more sources
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover [PDF]
International Symposium on Algorithms and Computation, 2023 The $2$-Edge-Connected Spanning Subgraph problem (2-ECSS) is one of the most fundamental and well-studied problems in the context of network design. In the problem, we are given an undirected graph $G$, and the objective is to find a $2$-edge-connected ...
Yusuke Kobayashi, Takashi Noguchi
openalex +3 more sources
Strong Edge Cover of the Graph
, 2017 The degree of a vertex v (denoted by deg(v)) is equal to the number of vertices that are adjacent to v. If there is a vertex v ∈ V(G) such that deg(v) = 0 then v is called an isolated vertex. If deg(v) = 1 then v is called a pendent vertex.
D. K. Thakkar, B. M. Kakrecha
openalex +2 more sources
Fast Sampling of $b$-Matchings and $b$-Edge Covers [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2023 For an integer $b \ge 1$, a $b$-matching (resp. $b$-edge cover) of a graph $G=(V,E)$ is a subset $S\subseteq E$ of edges such that every vertex is incident with at most (resp. at least) $b$ edges from $S$.
Zongchen Chen, Yuzhou Gu
openalex +3 more sources
Edge Cover Through Edge Coloring [PDF]
Electronic Journal of CombinatoricsLet $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned. Clearly $\xi(G) \
Guantao Chen, Songling Shan
openalex +2 more sources
Weighted Upper Edge Cover: Complexity and Approximability [PDF]
Workshop on Algorithms and Computation, 2018 Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution).
K. Khoshkhah +3 more
semanticscholar +1 more source
On the Complexity of the Upper r-Tolerant Edge Cover Problem
International Conference on Topics in Theoretical Computer Science, 2020 . We consider the problem of computing edge covers that are tolerant to a certain number of edge deletions. We call the problem of finding a minimum such cover r -Tolerant Edge Cover ( r -EC) and the problem of finding a maximum minimal such cover Upper r -
Ararat Harutyunyan +4 more
semanticscholar +1 more source
X-ray absorption spectroscopy and X-ray diffraction data for molybdenum minerals and compounds
Data in Brief, 2022 We report Mo K- and LIII-edge X-ray absorption spectroscopy (XAS) and X-ray diffraction (XRD) data collected for 15 molybdenum minerals and compounds sourced from museum collections, mineral dealers, and chemical suppliers. The samples were finely ground
Valerie A. Schoepfer +1 more
doaj +1 more source