{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S6BE2MDRXFDWVZ3KZIKSP3P44U","short_pith_number":"pith:S6BE2MDR","schema_version":"1.0","canonical_sha256":"97824d3071b9476ae76aca1527edfce500cc391f8f0f024205754955df1ad09b","source":{"kind":"arxiv","id":"1805.02412","version":2},"attestation_state":"computed","paper":{"title":"Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_7$-free and $P_8$-free chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Lhouari Nourine, Oscar Defrain","submitted_at":"2018-05-07T09:34:22Z","abstract_excerpt":"In [M. M. Kant\\'e, V. Limouzy, A. Mary, and L. Nourine. On the enumeration of minimal dominating sets and related notions. SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014] the authors give an $O(n+m)$ delay algorithm based on neighborhood inclusions for the enumeration of minimal dominating sets in split and $P_6$-free chordal graphs. In this paper, we investigate generalizations of this technique to $P_k$-free chordal graphs for larger integers $k$. In particular, we give $O(n+m)$ and $O(n^3\\cdot m)$ delays algorithms in the classes of $P_7$-free and $P_8$-free chordal graphs. As "},"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":"1805.02412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T09:34:22Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"5eb38dd99d2f79de5f1cea45b39cce27498fc3ac1714f45a361070b2dcebcd27","abstract_canon_sha256":"0e6959fd060f0ae2d5a2bfafe5a76f702331b5a497927860dbf27de5f5f7f313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:43.439890Z","signature_b64":"8s/D9rPTCUEkmC8fLPSbihPvOqOA/Opy/blmiLmURb/LNNqUky/gt0hPdTDKf97nry/t+kcVMVCZekCu9p2kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97824d3071b9476ae76aca1527edfce500cc391f8f0f024205754955df1ad09b","last_reissued_at":"2026-07-05T00:07:43.439476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:43.439476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_7$-free and $P_8$-free chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Lhouari Nourine, Oscar Defrain","submitted_at":"2018-05-07T09:34:22Z","abstract_excerpt":"In [M. M. Kant\\'e, V. Limouzy, A. Mary, and L. Nourine. On the enumeration of minimal dominating sets and related notions. SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014] the authors give an $O(n+m)$ delay algorithm based on neighborhood inclusions for the enumeration of minimal dominating sets in split and $P_6$-free chordal graphs. In this paper, we investigate generalizations of this technique to $P_k$-free chordal graphs for larger integers $k$. In particular, we give $O(n+m)$ and $O(n^3\\cdot m)$ delays algorithms in the classes of $P_7$-free and $P_8$-free chordal graphs. As "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02412","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.02412/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1805.02412","created_at":"2026-07-05T00:07:43.439534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02412v2","created_at":"2026-07-05T00:07:43.439534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02412","created_at":"2026-07-05T00:07:43.439534+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6BE2MDRXFDW","created_at":"2026-07-05T00:07:43.439534+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6BE2MDRXFDWVZ3K","created_at":"2026-07-05T00:07:43.439534+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6BE2MDR","created_at":"2026-07-05T00:07:43.439534+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/S6BE2MDRXFDWVZ3KZIKSP3P44U","json":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U.json","graph_json":"https://pith.science/api/pith-number/S6BE2MDRXFDWVZ3KZIKSP3P44U/graph.json","events_json":"https://pith.science/api/pith-number/S6BE2MDRXFDWVZ3KZIKSP3P44U/events.json","paper":"https://pith.science/paper/S6BE2MDR"},"agent_actions":{"view_html":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U","download_json":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U.json","view_paper":"https://pith.science/paper/S6BE2MDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02412&json=true","fetch_graph":"https://pith.science/api/pith-number/S6BE2MDRXFDWVZ3KZIKSP3P44U/graph.json","fetch_events":"https://pith.science/api/pith-number/S6BE2MDRXFDWVZ3KZIKSP3P44U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U/action/storage_attestation","attest_author":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U/action/author_attestation","sign_citation":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U/action/citation_signature","submit_replication":"https://pith.science/pith/S6BE2MDRXFDWVZ3KZIKSP3P44U/action/replication_record"}},"created_at":"2026-07-05T00:07:43.439534+00:00","updated_at":"2026-07-05T00:07:43.439534+00:00"}