scientific article; zbMATH DE number 7788412

DOI10.5555/3458064.3458138MaRDI QIDQ6147326zbMATH OpenFDO

Authors

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2007.07862

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Are there graphs whose shortest path structure requires large edge weights?
• Vertex sparsifiers for hyperedge connectivity
• Mimicking networks for constrained multicuts in hypergraphs
• All-subsets important separators with applications to sample sets, balanced separators and vertex sparsifiers in directed graphs
• Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147326)