On the complexity of community-aware network sparsification

Cites work

A Characterization of Soft Hypergraphs
Algorithms and Implementation for Interconnection Graph Problem
Clustered spanning tree -- conditions for feasibility
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
Constructing scalable overlays for pub-sub with many topics
Fundamentals of parameterized complexity
scientific article; zbMATH DE number 3694608 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 3641484 (Why is no real title available?)
Hypergraph planarity and the complexity of drawing venn diagrams
Hypergraphes arbores
Matroids and Subset Interconnection Design
Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
Network construction with subgraph connectivity constraints
On element-connectivity preserving graph simplification
On planar supports for hypergraphs
On the approximability and hardness of minimum topic connected overlay and its special instances
On the complexity of k-SAT
On the Desirability of Acyclic Database Schemes
Parameterized algorithms
Path-based supports for hypergraphs
Polynomial-time data reduction for the subset interconnection design problem
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
The clustering matroid and the optimal clustering tree
The complete optimal stars-clustering-tree problem
Vertices removal for feasibility of clustered spanning trees
Which problems have strongly exponential complexity?

This page was built for publication: On the complexity of community-aware network sparsification

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