Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Faster exact solution of sparse MaxCut and QUBO problems
The maximum-cut problem is one of the fundamental problems in combinatorial
optimization. With the advent of quantum computers, both the maximum-cut and the …
optimization. With the advent of quantum computers, both the maximum-cut and the …
[PDF][PDF] Recent Advances in Practical Data Reduction.
Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …
[HTML][HTML] SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem
The maximum weight clique problem (MWCP) is an important generalization of the
maximum clique problem with wide applications. In this study, we develop two efficient local …
maximum clique problem with wide applications. In this study, we develop two efficient local …
Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
The minimum weight dominating set (MWDS) problem is an important generalization of the
minimum dominating set problem with various applications. In this work, we develop an …
minimum dominating set problem with various applications. In this work, we develop an …
High-performance parallel graph coloring with strong guarantees on work, depth, and quality
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on
work and depth and coloring quality. The key idea is to design a relaxation of the vertex …
work and depth and coloring quality. The key idea is to design a relaxation of the vertex …
An exact algorithm with new upper bounds for the maximum k-defective clique problem in massive sparse graphs
Abstract The Maximum k-Defective Clique Problem (MDCP), as a clique relaxation model,
has been used to solve various problems. Because it is a hard computational task, previous …
has been used to solve various problems. Because it is a hard computational task, previous …
[PDF][PDF] A fast local search algorithm for minimum weight dominating set problem on massive graphs.
The minimum weight dominating set (MWDS) problem is NP-hard and also important in
many applications. Recent heuristic MWDS algorithms can hardly solve massive real world …
many applications. Recent heuristic MWDS algorithms can hardly solve massive real world …
[PDF][PDF] An exact algorithm for maximum k-plexes in massive graphs.
The maximum k-plex, a generalization of maximum clique, is used to cope with a great
number of real-world problems. The aim of this paper is to propose a novel exact k-plex …
number of real-world problems. The aim of this paper is to propose a novel exact k-plex …
On the external validity of average-case analyses of graph algorithms
The number one criticism of average-case analysis is that we do not actually know the
probability distribution of real-world inputs. Thus, analyzing an algorithm on some random …
probability distribution of real-world inputs. Thus, analyzing an algorithm on some random …
Reduction and local search for weighted graph coloring problem
The weighted graph coloring problem (WGCP) is an important extension of the graph
coloring problem (GCP) with wide applications. Compared to GCP, where numerous …
coloring problem (GCP) with wide applications. Compared to GCP, where numerous …