Sign inGet started
Dataset · Hugging Face

conashin/hgp-benchmark-unweighted

Hypergraph Partitioning Benchmark — Unweighted Netlist Format Converted benchmark dataset for two-way hypergraph partitioning (min-cut under balance constraint).Derived from the integrated benchmark collection at Zenodo 15373339, re-formatted into a plain unweighted netlist format suitable for EDA partitioning toolchains. Dataset Summary Property Value Total cases 489 Cell count range 5,804 – 9,128,020 Net count range 163 – 6,920,306 Pin count… See the full description on the dataset page: https://huggingface.co/datasets/conashin/hgp-benchmark-unweighted.

Author / organizationconashin
License (as declared)cc-by-4.0
Downloads367 (as reported by Hugging Face)
Likes0
Created16 May 2026
Last updated at source16 May 2026
hypergraphpartitioningVLSIEDAbenchmarknetlist
Embed this entry
<iframe src="https://silytics.si/embed/item/93692abf-a0c4-4ea4-b60d-4384062041b5" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

367 now. Counts as reported by the source, snapshotted daily by Silytics.

Recent changes

  • 16 Oct 2026 Description: Hypergraph Partitioning Benchmark — Unweighted Netlist Format Converted benchmark dataset for two-way hypergraph partitioning (min-cut under balance constraint).Derived from the integrated benchmark collection at Zenodo 15373339, re-formatt → Hypergraph Partitioning Benchmark — Unweighted Netlist Format Converted benchmark dataset for two-way hypergraph partitioning (min-cut under balance constraint).Derived from the integrated benchmark collection at Zenodo 15373339, re-formatt

Changes detected by Silytics between refreshes of the source.

Silytics shows public metadata from Hugging Face and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.