Enhanced IP spoofing defense through clustered interdomain packet filtering strategy by Lee, Soon

“…Filtering nodes are chosen based on vertex cover of the graph. This thesis presents a clustered strategy for selection of filtering nodes for IDPF architecture. …”
Get full text

Incentive compatible design of reverse auctions. by Gravin, Nikolai.

“…We analyze the performance of incentive compatible procedures against two standard benchmarks and introduce a general scheme that proved to be optimal on some subclasses of vertex cover and all k-paths set systems. Our results completely settled the design of optimal frugal mechanism in path auctions, a decade-long standing open problem in algorithmic mechanism design proposed by Archer and Tardos. …”
Get full text

Parallel discrete geodesic algorithms by Du, Jie

“…The VTP algorithm takes vertices as primitives and maintains a priority queue to control the order of window list propagation around the vertex to update wavefront. Our parallel-VTP (PVTP) framework includes three main steps: K-window-list selection, parallel window list propagation, vertex distance updating and window list merging. …”
Get full text

Quantum photonic computing chips and its algorithms by Zhu, Huihui

“…The GBS-based quantum photonic microprocessor is applied to solve task assignment, Boolean satisfiability, graph clique, max cut, and vertex cover. These demonstrations suggest an excellent benchmarking platform, paving the way toward large-scale combinatorial optimization. …”
Get full text

A local characterization of the graphs of alternating forms and the graphs of quadratic forms over GF(2) by Munemasa, A., Pasechnik, Dmitrii V., Shpectorov, Sergey V.

“…Let Γ be a connected locally Δ graph such that 1. the number of common neighbours of any pair of vertices at distance two is the same as in Alt(n,2). 2. the valency of the subgraph induced on the second neighbourhood of any vertex is the same as in Alt(n,2). It is shown that Γ is covered either by Alt(n,2) or by the graph of (n – l)-dimensional GF(2)-quadratic forms Quad(n – 1,2).…”
Get full text
Get full text

An Algorithmic Framework for Estimating Rumor Sources With Different Start Times by Ji, Feng, Tay, Wee Peng, Varshney, Lav R.

“…We introduce the notion of an abstract estimator that, given the infection graph, assigns a higher value to each vertex in the graph it considers more likely to be a rumor source. …”
Get full text
Get full text

Automatic occupation identification of Twitter users using graph neural network by Li, Jiaheng

“…More and more users are now publishing academic articles on Twitter because they want to share their research results, want to have discussions on Twitter with practitioners in related fields covered by others, and want to share cutting-edge research results. …”
Get full text