Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[کتاب][B] Recent advances in graph partitioning
A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz - 2016 - Springer
Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …
The L (h, k)-labelling problem: an updated survey and annotated bibliography
Given any fixed non-negative integer values h and k, the L (h, k)-labelling problem consists
in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes …
in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes …
A fast and high quality multilevel scheme for partitioning irregular graphs
Recently, a number of researchers have investigated a class of graph partitioning algorithms
that reduce the size of the graph by collapsing vertices and edges, partition the smaller …
that reduce the size of the graph by collapsing vertices and edges, partition the smaller …
Multilevelk-way partitioning scheme for irregular graphs
In this paper, we present and study a class of graph partitioning algorithms that reduces the
size of the graph by collapsing vertices and edges, we find ak-way partitioning of the smaller …
size of the graph by collapsing vertices and edges, we find ak-way partitioning of the smaller …
The geometry of graphs and some of its algorithmic applications
In this paper we explore some implications of viewing graphs as geometric objects. This
approach offers a new perspective on a number of graph-theoretic and algorithmic …
approach offers a new perspective on a number of graph-theoretic and algorithmic …
Parallel multilevel k-way partitioning scheme for irregular graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning
algorithm. The multilevel k-way partitioning algorithm reduces the size of the graph by …
algorithm. The multilevel k-way partitioning algorithm reduces the size of the graph by …
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
PB Callahan, SR Kosaraju - Journal of the ACM (JACM), 1995 - dl.acm.org
We define the notion of a well-separated pair decomposition of points in d-dimensional
space. We then develop efficient sequential and parallel algorithms for computing such a …
space. We then develop efficient sequential and parallel algorithms for computing such a …
Mesh generation and optimal triangulation
We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …
especially focus on optimal triangulations of geometric domains in two-and three …
Programming parallel algorithms
parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most
problems for which efficient sequential solutions are known. Although some ofthese …
problems for which efficient sequential solutions are known. Although some ofthese …
[کتاب][B] Combinatorial geometry
J Pach, PK Agarwal - 2011 - books.google.com
A complete, self-contained introduction to a powerful and resurging mathematical discipline
Combinatorial Geometry presents and explains with complete proofs some of the most …
Combinatorial Geometry presents and explains with complete proofs some of the most …