Paper Citation Record · LEDGER

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs

As of 8 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2506.02346.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.02346 v1

Coverage vector

measured 42 of 42 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:33:05.742501Z

measured 42 of 42 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

42 of 42 outbound references displayed

verified exact12
verified fuzzy23
unresolved6
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e90a1f8e-2698-4f6d-b649-ef7e4a360ffd · outbound

This paper cites Decomposition trees: structured graph representation and efficient algorithms.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Decomposition trees: structured graph representation and efficient algorithms

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:12.792808Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2a7d18c8-c390-481c-81e4-037a111f1b18 · outbound

This paper cites Complexity of finding embeddings in ak-tree.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Complexity of finding embeddings in ak-tree

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:12.655360Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c02325ef-d1a5-451f-8699-b8594d7ca31c · outbound

This paper cites A linear time algorithm for finding tree-decompositions of small treewidth.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs A linear time algorithm for finding tree-decompositions of small treewidth

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T11:33:01.493975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77404c2e-dc67-43bb-a959-e440cfa8284e · outbound

This paper cites Tree decomposition: A feasibility study.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Tree decomposition: A feasibility study

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:12.457833Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e13d25cf-04c2-4cc5-a3eb-55ce71ab11c0 · outbound

This paper cites Algorithms finding tree-decompositions of graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Algorithms finding tree-decompositions of graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:12.303483Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 085c098e-8d87-4914-b94e-42e6dd61480e · outbound

This paper cites an unresolved cited work.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:33:12.132169Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 9739e74b-1cbd-448f-8590-b042a6a866ce · outbound

This paper cites an unresolved cited work.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:33:11.928023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3b2ff6bd-e57b-4740-b310-78ce6ba32e23 · outbound

This paper cites K-packings and k-dominations on tree graphs (2004).

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs K-packings and k-dominations on tree graphs (2004)

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:11.755893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c3f71a54-bde5-4bd6-b111-6b8a15926724 · outbound

This paper cites Algorithms for minimum weighted dominating sets in cycles and cacti.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Algorithms for minimum weighted dominating sets in cycles and cacti

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:11.550759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6e208cb6-9f6d-43b4-81e6-f7b93c85c0be · outbound

This paper cites Algorithm to find a maximum 2-packing set in a cactus.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Algorithm to find a maximum 2-packing set in a cactus

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:11.353836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e31a93a1-4441-4cbc-a1b3-96534a9b7cdc · outbound

This paper cites Algorithmic meta-theorems for restrictions of treewidth.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Algorithmic meta-theorems for restrictions of treewidth

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T11:33:02.662796Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a9a8ebec-595e-430b-ac0f-e5b4d7ee3a83 · outbound

This paper cites an unresolved cited work.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Unresolved cited work

Reference 12

Resolution: verified exact; doi, observed 2026-08-07T11:33:07.288760Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d998507d-b232-4cac-9cd0-564bd2bba5b8 · outbound

This paper cites Fundamentals of parameterized complexity, volume 4.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Fundamentals of parameterized complexity, volume 4

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:11.202828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c293e88f-0cdf-488d-8e1b-c96c71f5e24e · outbound

This paper cites Improved approximation algorithms for minimum-weight vertex separators.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Improved approximation algorithms for minimum-weight vertex separators

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:11.030442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ad720441-8092-4f5a-a6fc-8eb10c78f7c7 · outbound

This paper cites Approximate tree decompositions of planar graphs in linear time.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Approximate tree decompositions of planar graphs in linear time

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:10.866023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 1a15a720-2ff1-41bc-ac93-e6bddda03362 · outbound

This paper cites Treelength of series–parallel graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Treelength of series–parallel graphs

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:10.722330Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 35b86b4f-4256-4949-8242-052c7a23ce3d · outbound

This paper cites Computing bounded-width tree and branch decompositions of k-outerplanar graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Computing bounded-width tree and branch decompositions of k-outerplanar graphs

Reference 17

Resolution: verified exact; local_arxiv, observed 2026-08-07T11:33:07.021313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation cf4c9283-901e-4bcf-9fcb-96115507d554 · outbound

This paper cites Planar graphs with bounded treewidth.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Planar graphs with bounded treewidth

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:10.507415Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e5d89f29-bdbe-413d-804e-ecbb02587dc2 · outbound

This paper cites The pathwidth and treewidth of cographs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs The pathwidth and treewidth of cographs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:10.318430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation b267efca-4314-43f3-ad97-a7de1ab3e15e · outbound

This paper cites Treewidth of circular-arc graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Treewidth of circular-arc graphs

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:10.154613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c6f4e271-8a01-4de0-98ce-8a59a3219ac6 · outbound

This paper cites Better algorithms for the pathwidth and treewidth of graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Better algorithms for the pathwidth and treewidth of graphs

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:09.958973Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6f4054aa-a63d-4df8-8fb1-31f585285481 · outbound

This paper cites Invitation to fixed-parameter algorithms, volume 31.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Invitation to fixed-parameter algorithms, volume 31

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:09.742703Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 07569ae5-ff77-4fe7-9a02-1e6a631724c4 · outbound

This paper cites Treelike and chordal graphs: Algorithms and generalizations.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Treelike and chordal graphs: Algorithms and generalizations

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:09.579231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fc62b4b5-26cc-41f3-8cb3-3061d4cf5d48 · outbound

This paper cites an unresolved cited work.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Unresolved cited work

Reference 24

Resolution: verified exact; doi, observed 2026-08-07T11:33:06.775978Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 523da967-f66a-4d73-8e99-36a0022b1d3b · outbound

This paper cites Linear algorithms for graphs of tree-width at most four.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Linear algorithms for graphs of tree-width at most four

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:09.408223Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e15583df-82a6-402b-a097-643796296602 · outbound

This paper cites an unresolved cited work.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Unresolved cited work

Reference 26

Resolution: verified exact; doi, observed 2026-08-07T11:33:09.179495Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 0a0a7fc3-08e6-444f-888c-36afefea8278 · outbound

This paper cites Characterization and recognition of partial 3-trees.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Characterization and recognition of partial 3-trees

Reference 27

Resolution: verified exact; doi, observed 2026-08-07T11:33:06.630096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6cd22c3f-f9d6-4e8e-8944-b3c8509d429f · outbound

This paper cites libtw, 2006.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs libtw, 2006

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:08.819915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d06ceeae-5ff4-49ce-bfc7-0eb4e276dd1e · outbound

This paper cites Bodlaender, Arie M.C.A.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Bodlaender, Arie M.C.A

Reference 29

Resolution: malformed identifier; no resolver link, observed 2026-08-07T11:33:04.908764Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fddeb832-7b9b-4129-9df9-6a9da3b7e5be · outbound

This paper cites The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration

Reference 30

Resolution: verified exact; doi, observed 2026-08-07T11:33:09.013599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f3db73c3-bc19-4d88-b753-d5663692dfa4 · outbound

This paper cites Fomin and Dimitrios M.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Fomin and Dimitrios M

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-07T11:33:05.083306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a199782-cc61-45dc-84b0-4c8b51bc863d · outbound

This paper cites A distributed algorithm for a maximal 2-packing set in halin graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs A distributed algorithm for a maximal 2-packing set in halin graphs

Reference 32

Resolution: verified exact; doi, observed 2026-08-07T11:33:06.447635Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d0c40344-1004-4ca2-b096-757d22833f28 · outbound

This paper cites Studies on minimally n-connected graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Studies on minimally n-connected graphs

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:08.606368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fff418ae-4abb-473e-be6c-a0994c710407 · outbound

This paper cites Halin graphs and the travelling salesman problem.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Halin graphs and the travelling salesman problem

Reference 34

Resolution: verified exact; doi, observed 2026-08-07T11:33:06.267379Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ec27b0a4-516e-4eff-896b-02e1ac9f0205 · outbound

This paper cites The pancyclicity of Halin graphs and their exterior contractions.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs The pancyclicity of Halin graphs and their exterior contractions

Reference 35

Resolution: verified exact; doi, observed 2026-08-07T11:33:06.128620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f1616b7a-3841-4223-a3e5-9fbb32d5b126 · outbound

This paper cites Simple recognition of Halin graphs and their generalizations.Journal of Graph Algorithms and Applications, 20(2):323–346, 2016.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Simple recognition of Halin graphs and their generalizations.Journal of Graph Algorithms and Applications, 20(2):323–346, 2016

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-07T11:33:05.273174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a270678b-ecb0-4e04-8a5d-3f2fb7c248db · outbound

This paper cites Graph theory, volume 173 of.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Graph theory, volume 173 of

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:08.178582Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c506fe5b-3b19-4b65-8ffc-951f4187d90c · outbound

This paper cites Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh

Reference 38

Resolution: verified exact; doi, observed 2026-08-07T11:33:05.966663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 1c26e201-5ad7-435a-8d96-1e06e44640ab · outbound

This paper cites Lengths of cycles in halin graphs.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Lengths of cycles in halin graphs

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:08.396251Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 7f2185b4-6f0d-447c-bab0-9d849b7948f1 · outbound

This paper cites To avoid invoking a recursive call, we must also ensure that h(cw,a) = 0.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs To avoid invoking a recursive call, we must also ensure that h(cw,a) = 0

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:33:07.999236Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 35ba3ffa-a37a-4eb7-acab-5675e0f1d1a3 · outbound

This paper cites doi:https://doi.org/10.1016/0196-6774(91)90020-Y.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs doi:https://doi.org/10.1016/0196-6774(91)90020-Y

Reference 1991

Resolution: verified exact; doi, observed 2026-08-07T11:33:07.689292Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a7be92eb-2d19-4f6e-93ff-df5eb387a39d · outbound

This paper cites an unresolved cited work.

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Unresolved cited work

Reference 1996

Resolution: verified exact; doi, observed 2026-08-07T11:33:07.470498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

No inbound Pith citation observations are available.