Results 1 to 10 of about 3,659,863 (306)
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
Cover Edge-Based Novel Triangle Counting [PDF]
AlgorithmsCounting and listing triangles in graphs is a fundamental task in network analysis, supporting applications such as community detection, clustering coefficient computation, k-truss decomposition, and triangle centrality.
David A. Bader +10 more
doaj +2 more sources
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
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 +9 more
openalex +2 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
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
Cover Art: River's Edge: Downward, Outward, Upward
Interdisciplinary Journal of Partnership Studies, 2017 Artist's Statement for the cover art of IJPS volume 4, issue 3: River's Edge: Downward, Outward, Upward, 2015. Mixed Media: photograph, inkjet printed on presentation matte of colored pencil over photograph.
Jonee Kulman Brigham
doaj +3 more sources
The importance of Indigenous Lands and landscape structure in shaping the zoonotic disease risk—Insights from the Brazilian Atlantic Forest [PDF]
One HealthIndigenous Peoples hold traditional knowledge rooted in their ancestral ties to the land, contributing to lower deforestation and higher biodiversity. These ecological benefits may also support public health, as intact ecosystems help reduce the risk of ...
Ana Filipa Palmeirim +2 more
doaj +2 more sources
On The Study of Edge Monophonic Vertex Covering Number
Ratio Mathematica, 2022 For a connected graph G of order n ≥ 2, a set S of vertices of G is an edge monophonic vertex cover of G if S is both an edge monophonic set and a vertex covering set of G.
K.A Francis Jude Shini +3 more
doaj +1 more source
Remote Sensing, 2022 Even though research has shown that the spectral parameters of yellow-edge, red-edge and NIR (near-infrared) shoulder wavelength regions are able to estimate green cover and leaf area index (LAI), a large amount of dead materials in grasslands challenges
Dandan Xu +3 more
doaj +1 more source