{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JS7BQXIDUJB2EUUQ4Q2Y4774XX","short_pith_number":"pith:JS7BQXID","schema_version":"1.0","canonical_sha256":"4cbe185d03a243a25290e4358e7ffcbde507c40f4e5847eac85360e69bbfa029","source":{"kind":"arxiv","id":"1208.5345","version":2},"attestation_state":"computed","paper":{"title":"Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Petr A. Golovach, Pinar Heggernes, Yngve Villanger","submitted_at":"2012-08-27T09:38:56Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1208.5345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-27T09:38:56Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f32774ad2271a7c3be30b42cae968b22f2e6ad42605f95e70a3a70086a1a0b14","abstract_canon_sha256":"500b8d8b7e530362b016520399c1c1e68399be8478eb3a744b4a7a840486efae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:33.636517Z","signature_b64":"qtZa4oeAJA1CNcP2zqF2SpzBiU5E7RtJL4gz1azwA4vp63kw/PSA4/cFiSMywk4xDE7OLXW686LZFTQNWQS8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cbe185d03a243a25290e4358e7ffcbde507c40f4e5847eac85360e69bbfa029","last_reissued_at":"2026-05-18T03:42:33.635784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:33.635784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Petr A. Golovach, Pinar Heggernes, Yngve Villanger","submitted_at":"2012-08-27T09:38:56Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5345","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.5345","created_at":"2026-05-18T03:42:33.635892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5345v2","created_at":"2026-05-18T03:42:33.635892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5345","created_at":"2026-05-18T03:42:33.635892+00:00"},{"alias_kind":"pith_short_12","alias_value":"JS7BQXIDUJB2","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JS7BQXIDUJB2EUUQ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JS7BQXID","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX","json":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX.json","graph_json":"https://pith.science/api/pith-number/JS7BQXIDUJB2EUUQ4Q2Y4774XX/graph.json","events_json":"https://pith.science/api/pith-number/JS7BQXIDUJB2EUUQ4Q2Y4774XX/events.json","paper":"https://pith.science/paper/JS7BQXID"},"agent_actions":{"view_html":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX","download_json":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX.json","view_paper":"https://pith.science/paper/JS7BQXID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5345&json=true","fetch_graph":"https://pith.science/api/pith-number/JS7BQXIDUJB2EUUQ4Q2Y4774XX/graph.json","fetch_events":"https://pith.science/api/pith-number/JS7BQXIDUJB2EUUQ4Q2Y4774XX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX/action/storage_attestation","attest_author":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX/action/author_attestation","sign_citation":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX/action/citation_signature","submit_replication":"https://pith.science/pith/JS7BQXIDUJB2EUUQ4Q2Y4774XX/action/replication_record"}},"created_at":"2026-05-18T03:42:33.635892+00:00","updated_at":"2026-05-18T03:42:33.635892+00:00"}