{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:76DRN2UOW7KCRDSD66VQAWASF2","short_pith_number":"pith:76DRN2UO","schema_version":"1.0","canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","source":{"kind":"arxiv","id":"1408.6196","version":1},"attestation_state":"computed","paper":{"title":"Exact Algorithms for Dominating Induced Matching Based on Graph Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","submitted_at":"2014-08-26T18:10:49Z","abstract_excerpt":"A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \\subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint and each edge in $E\\setminus F$ is incident with exactly one edge in $F$. It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design a $1.1467^nn^{O(1)}$-time exact algorithm for this problem, improving all previous results. This problem can be redefined as a partition problem that is to partition the vertex s"},"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":"1408.6196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T18:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"1652fefb3165e1b9fe99333cfc863b99175f4fec84bcc698a73b625faacc9864","abstract_canon_sha256":"65e5cebcc1d4286f266c256fb5cfb6c849077ef7d3218586a42b700baba2b3b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.819636Z","signature_b64":"XXBenx2Q2lmH4I7vnoxYUPCbTQ7nufHzvU2SjjkUCBuS8JDXICU74hU/0HgYWBHV8aLOIpOTsit1bKps5l6TBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","last_reissued_at":"2026-05-18T00:38:36.819151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.819151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Algorithms for Dominating Induced Matching Based on Graph Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","submitted_at":"2014-08-26T18:10:49Z","abstract_excerpt":"A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \\subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint and each edge in $E\\setminus F$ is incident with exactly one edge in $F$. It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design a $1.1467^nn^{O(1)}$-time exact algorithm for this problem, improving all previous results. This problem can be redefined as a partition problem that is to partition the vertex s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6196","kind":"arxiv","version":1},"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":"1408.6196","created_at":"2026-05-18T00:38:36.819218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6196v1","created_at":"2026-05-18T00:38:36.819218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6196","created_at":"2026-05-18T00:38:36.819218+00:00"},{"alias_kind":"pith_short_12","alias_value":"76DRN2UOW7KC","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"76DRN2UOW7KCRDSD","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"76DRN2UO","created_at":"2026-05-18T12:28:16.859392+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/76DRN2UOW7KCRDSD66VQAWASF2","json":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2.json","graph_json":"https://pith.science/api/pith-number/76DRN2UOW7KCRDSD66VQAWASF2/graph.json","events_json":"https://pith.science/api/pith-number/76DRN2UOW7KCRDSD66VQAWASF2/events.json","paper":"https://pith.science/paper/76DRN2UO"},"agent_actions":{"view_html":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2","download_json":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2.json","view_paper":"https://pith.science/paper/76DRN2UO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6196&json=true","fetch_graph":"https://pith.science/api/pith-number/76DRN2UOW7KCRDSD66VQAWASF2/graph.json","fetch_events":"https://pith.science/api/pith-number/76DRN2UOW7KCRDSD66VQAWASF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/action/storage_attestation","attest_author":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/action/author_attestation","sign_citation":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/action/citation_signature","submit_replication":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/action/replication_record"}},"created_at":"2026-05-18T00:38:36.819218+00:00","updated_at":"2026-05-18T00:38:36.819218+00:00"}