Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Progress on material characterization methods under big data environment
L Chen, C Lan, B Xu, K Bi - Advanced Composites and Hybrid Materials, 2021 - Springer
Material characterization is a non-substitutable and important part of high-throughput
computational material science under big data environment. With the development of …
computational material science under big data environment. With the development of …
Partitioning a graph into small pieces with applications to path transversal
E Lee - Proceedings of the Twenty-Eighth Annual ACM-SIAM …, 2017 - SIAM
Given a graph G=(V, E) and an integer k∊ ℕ, we study k-Vertex Separator (resp. k-Edge
Separator), where the goal is to remove the minimum number of vertices (resp. edges) such …
Separator), where the goal is to remove the minimum number of vertices (resp. edges) such …
Vertex Cover of Networks and Its Related Optimization Problems: An Overview
As a well-known NP-hard problem, the vertex cover problem has broad applications, which
has aroused the concern of many researchers. In recent years, its related optimization …
has aroused the concern of many researchers. In recent years, its related optimization …
On computing the minimum 3-path vertex cover and dissociation number of graphs
The dissociation number of a graph G is the number of vertices in a maximum size induced
subgraph of G with vertex degree at most 1. A k-path vertex cover of a graph G is a subset S …
subgraph of G with vertex degree at most 1. A k-path vertex cover of a graph G is a subset S …
Relief aid provision to en route refugees: Multi-period mobile facility location with mobile demand
Many humanitarian organizations aid en route refugee groups who are on their journey to
cross borders using mobile facilities and need to decide the number and routes of the …
cross borders using mobile facilities and need to decide the number and routes of the …
On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
W Sun, S Li - Taiwanese Journal of Mathematics, 2023 - projecteuclid.org
Given a graph $ G $ with $ S\subseteq V_G $, we call $ S $ a maximum dissociation set if
the induced subgraph $ G [S] $ contains no path of order $3 $, and subject to this condition …
the induced subgraph $ G [S] $ contains no path of order $3 $, and subject to this condition …
A primal–dual approximation algorithm for the vertex cover P3 problem
J Tu, W Zhou - Theoretical Computer Science, 2011 - Elsevier
We introduce the vertex coverPn (VCPn) problem, that is, the problem of finding a minimum
weight set F⊂ V such that the graph G [V− F] has no Pn, where Pn is a path with n vertices …
weight set F⊂ V such that the graph G [V− F] has no Pn, where Pn is a path with n vertices …
A factor 2 approximation algorithm for the vertex cover P3 problem
J Tu, W Zhou - Information Processing Letters, 2011 - Elsevier
We consider the vertex coverPn (VCPn) problem, that is, the problem of finding a minimum
weight set F⊂ V such that the graph G [V− F] has no Pn, where Pn is a path with n vertices …
weight set F⊂ V such that the graph G [V− F] has no Pn, where Pn is a path with n vertices …
[HTML][HTML] On the vertex k-path cover
A subset S of vertices of a graph G is called a vertex k-path cover if every path of order k in G
contains at least one vertex from S. Denote by ψk (G) the minimum cardinality of a vertex k …
contains at least one vertex from S. Denote by ψk (G) the minimum cardinality of a vertex k …
[HTML][HTML] Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
M **ao, S Kou - Theoretical Computer Science, 2017 - Elsevier
A dissociation set in a graph G=(V, E) is a vertex subset D such that the subgraph G [D]
induced on D has vertex degree at most 1. A 3-path vertex cover in a graph is a vertex …
induced on D has vertex degree at most 1. A 3-path vertex cover in a graph is a vertex …