Publication

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Jakab Tardos
2021
Conference Papers

Abstract

Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applications. However, the current bounds on the size of hypergraph sparsifiers are not as tight as the corresponding bounds for graphs.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Chat with Graph Search

Non-planarity of Markoff graphs mod p

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Graph generative deep learning models with an application to circuit topologies