Compression with wildcards: All induced metric subgraphs
Marcel Wild

TL;DR
This paper introduces two algorithms for enumerating metric subgraphs in graphs, one producing compressed output and the other generating sets individually with polynomial delay, advancing graph enumeration methods.
Contribution
It presents novel algorithms for enumerating metric and geodesically-convex subgraphs, with one algorithm providing compressed enumeration and the other ensuring output-polynomial time.
Findings
The { t AllMetricSets} algorithm efficiently compresses metric subgraph enumeration.
The second algorithm guarantees output-polynomial time for listing metric sets.
The methods extend to geodesically-convex sets, strengthening the enumeration framework.
Abstract
Driven by applications in the natural, social and computer sciences several algorithms have been proposed to enumerate all sets of vertices of a graph that induce a {\it connected} subgraph. We offer two algorithms for enumerating all 's that induce (more exquisite) {\it metric} subgraphs. Specifically, the first algorithm, called {\tt AllMetricSets}, generates these 's in a compressed format. The second algorithm generates all (accessible) metric sets one-by-one but is provably output-polynomial. Mutatis mutandis the same holds for the geodesically-convex sets , this being a natural strengthening of "metric". The Mathematica command {\tt BooleanConvert} features prominently.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Graph Labeling and Dimension Problems · Advanced Image and Video Retrieval Techniques
