While there has been significant work on parallel graph processing, there has been very
surprisingly little work on high-performance hypergraph processing. This paper presents a …

We investigate the distributed complexity of maximal matching and maximal independent set
(MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph H=(VH, EH) …

With the increasing need for graph analysis, massive Concurrent iterative Graph Processing
(CGP) jobs are usually performed on the common large-scale real-world graph. Although …

Beyond ordinary graphs, hypergraphs are a graph representation to flexibly express
complex multilateral relationships between entities. Hypergraph processing can be used to …

Hypergraph processing has emerged as a powerful approach for analyzing complex
multilateral relationships among multiple entities. Past research on building hypergraph …

Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS)
and coloring have been recognized as important by the community, and studied extensively …

Hypergraphs are recently emerging as a robust set-theoretical mathematical tool that can
faithfully model higher-order relationships among the entities in a dataset. To design efficient …

A parallel algorithm for maximal independent set (MIS) in hypergraphs has been a long-
standing algorithmic challenge, dating back nearly 30 years to a survey of Karp and …

Given a graph, a maximal independent set (MIS) is a maximal subset of pairwise non-
adjacent vertices. Finding an MIS is a fundamental problem in distributed computing …

The literature provides evidence that considering signal propagation delays can significantly
enhance the scheduling rate region of wireless networks. This paper focuses on the link …