{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VEOFRJWHOOVDO4XRK2N5CGG4RL","short_pith_number":"pith:VEOFRJWH","schema_version":"1.0","canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","source":{"kind":"arxiv","id":"1511.01696","version":2},"attestation_state":"computed","paper":{"title":"Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"K. Krishna Mohan Reddy, N. Sadagopan, P. Renjith","submitted_at":"2015-11-05T11:03:49Z","abstract_excerpt":"For a connected labelled graph $G$, a {\\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$. In this paper, we consider a classical combinatorial problem which is to list all spanning trees of $G$. A Halin graph is a graph obtained from a tree with no degree two vertices and by joining all leaves with a cycle. We present a sequential and parallel algorithm to enumerate all spanning trees in Halin graphs. Our approach enumerates without repetitions and we make use of $O((2pd)^{p})$ processors for parallel algorithmics, where $d$ and $p$ are the depth, the"},"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":"1511.01696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T11:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"3d76fe52b817c16e0967a3db0ba366a68ec2fb1c5c8c42c8863b26a13e7ac919","abstract_canon_sha256":"51d083d7ec4ff54357fca30eff69bdfd61bb0adfe08cc3bacf10766f6383d0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.838213Z","signature_b64":"JVZ20IcZZ2OYsEQCEvjx57IVCyq9otnwJoYVJ4t9MmqYCi9MPR34wB96F7AjporLTPdFVUmOJe4S/sHMQfyuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","last_reissued_at":"2026-05-18T01:10:45.837816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.837816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"K. Krishna Mohan Reddy, N. Sadagopan, P. Renjith","submitted_at":"2015-11-05T11:03:49Z","abstract_excerpt":"For a connected labelled graph $G$, a {\\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$. In this paper, we consider a classical combinatorial problem which is to list all spanning trees of $G$. A Halin graph is a graph obtained from a tree with no degree two vertices and by joining all leaves with a cycle. We present a sequential and parallel algorithm to enumerate all spanning trees in Halin graphs. Our approach enumerates without repetitions and we make use of $O((2pd)^{p})$ processors for parallel algorithmics, where $d$ and $p$ are the depth, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01696","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":"1511.01696","created_at":"2026-05-18T01:10:45.837880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01696v2","created_at":"2026-05-18T01:10:45.837880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01696","created_at":"2026-05-18T01:10:45.837880+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEOFRJWHOOVD","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEOFRJWHOOVDO4XR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEOFRJWH","created_at":"2026-05-18T12:29:44.643036+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/VEOFRJWHOOVDO4XRK2N5CGG4RL","json":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL.json","graph_json":"https://pith.science/api/pith-number/VEOFRJWHOOVDO4XRK2N5CGG4RL/graph.json","events_json":"https://pith.science/api/pith-number/VEOFRJWHOOVDO4XRK2N5CGG4RL/events.json","paper":"https://pith.science/paper/VEOFRJWH"},"agent_actions":{"view_html":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL","download_json":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL.json","view_paper":"https://pith.science/paper/VEOFRJWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01696&json=true","fetch_graph":"https://pith.science/api/pith-number/VEOFRJWHOOVDO4XRK2N5CGG4RL/graph.json","fetch_events":"https://pith.science/api/pith-number/VEOFRJWHOOVDO4XRK2N5CGG4RL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/action/storage_attestation","attest_author":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/action/author_attestation","sign_citation":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/action/citation_signature","submit_replication":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/action/replication_record"}},"created_at":"2026-05-18T01:10:45.837880+00:00","updated_at":"2026-05-18T01:10:45.837880+00:00"}