The Densest $k$-Subhypergraph Problem (2018)

First Author: Chlamtác E

Attributed to: Sublinear Algorithms for Big Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/16m1096402

Publication URI: http://dx.doi.org/10.1137/16m1096402

Type: Journal Article/Review

Parent Publication: SIAM Journal on Discrete Mathematics

Issue: 2