Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing
The vertex-centric programming model is an established computational paradigm recently
incorporated into distributed processing frameworks to address challenges in large-scale …
incorporated into distributed processing frameworks to address challenges in large-scale …
Scalable graph processing frameworks: A taxonomy and open challenges
The world is becoming a more conjunct place and the number of data sources such as
social networks, online transactions, web search engines, and mobile devices is increasing …
social networks, online transactions, web search engines, and mobile devices is increasing …
[ספר][B] Kernelization: theory of parameterized preprocessing
FV Fomin, D Lokshtanov, S Saurabh, M Zehavi - 2019 - books.google.com
Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …
computation. Written by a team of experts in the field, this book introduces a rapidly …
Fast quantum circuit cutting with randomized measurements
We propose a new method to extend the size of a quantum computation beyond the number
of physical qubits available on a single device. This is accomplished by randomly inserting …
of physical qubits available on a single device. This is accomplished by randomly inserting …
[ספר][B] Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx… - 2015 - Springer
The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …
parameterized algorithms and complexity accessible to graduate students and advanced …
{GraphX}: Graph processing in a distributed dataflow framework
In pursuit of graph processing performance, the systems community has largely abandoned
general-purpose distributed dataflow frameworks in favor of specialized graph processing …
general-purpose distributed dataflow frameworks in favor of specialized graph processing …
A single-exponential time 2-approximation algorithm for treewidth
We give an algorithm that, given an-vertex graph and an integer, in time either outputs a tree
decomposition of of width at most or determines that the treewidth of is larger than. This is …
decomposition of of width at most or determines that the treewidth of is larger than. This is …
[ספר][B] Graph structure and monadic second-order logic: a language-theoretic approach
B Courcelle, J Engelfriet - 2012 - books.google.com
The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …
can be described algebraically, enabling them to be constructed out of more basic elements …
Generalized network dismantling
Finding an optimal subset of nodes in a network that is able to efficiently disrupt the
functioning of a corrupt or criminal organization or contain an epidemic or the spread of …
functioning of a corrupt or criminal organization or contain an epidemic or the spread of …
Expander flows, geometric embeddings and graph partitioning
We give a O (√ log n)-approximation algorithm for the sparsest cut, edge expansion,
balanced separator, and graph conductance problems. This improves the O (log n) …
balanced separator, and graph conductance problems. This improves the O (log n) …