{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JS7BQXIDUJB2EUUQ4Q2Y4774XX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"500b8d8b7e530362b016520399c1c1e68399be8478eb3a744b4a7a840486efae","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-27T09:38:56Z","title_canon_sha256":"f32774ad2271a7c3be30b42cae968b22f2e6ad42605f95e70a3a70086a1a0b14"},"schema_version":"1.0","source":{"id":"1208.5345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5345","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5345v2","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5345","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"JS7BQXIDUJB2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JS7BQXIDUJB2EUUQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JS7BQXID","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:3bbafe39f506a3b99d98bed6f1a9f4b114feb066c9d852e66def840b443ada31","target":"graph","created_at":"2026-05-18T03:42:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m^4 |L|^2) to generate the set L of all minimal edge dominating sets of G. For bipartite graphs we obtain a better result; we show that their minimal edge dominating sets can be enumerated in time O(m^4 |L|). In fact our results are stronger; both algorithms generate the next minimal edge dominating set with incremental-polynomial delay O(m^5 |L|) and O(m^4 |L|) respectively, when L is the set of already generated minimal edge dominating sets. Our algorithms are tailored for and solve the equivale","authors_text":"Dieter Kratsch, Petr A. Golovach, Pinar Heggernes, Yngve Villanger","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-27T09:38:56Z","title":"Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5345","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0c16eee947b28cf3a14026e9b461fb91faa18d8b5d6e5e8970390815e65fab1e","target":"record","created_at":"2026-05-18T03:42:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"500b8d8b7e530362b016520399c1c1e68399be8478eb3a744b4a7a840486efae","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-27T09:38:56Z","title_canon_sha256":"f32774ad2271a7c3be30b42cae968b22f2e6ad42605f95e70a3a70086a1a0b14"},"schema_version":"1.0","source":{"id":"1208.5345","kind":"arxiv","version":2}},"canonical_sha256":"4cbe185d03a243a25290e4358e7ffcbde507c40f4e5847eac85360e69bbfa029","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cbe185d03a243a25290e4358e7ffcbde507c40f4e5847eac85360e69bbfa029","first_computed_at":"2026-05-18T03:42:33.635784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:33.635784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtZa4oeAJA1CNcP2zqF2SpzBiU5E7RtJL4gz1azwA4vp63kw/PSA4/cFiSMywk4xDE7OLXW686LZFTQNWQS8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:33.636517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c16eee947b28cf3a14026e9b461fb91faa18d8b5d6e5e8970390815e65fab1e","sha256:3bbafe39f506a3b99d98bed6f1a9f4b114feb066c9d852e66def840b443ada31"],"state_sha256":"dc6362b735e1295886450d4c4c1e8f3587bdddda8ac26340866b503a6f26113a"}