J
J. D. Horton
Researcher at University of New Brunswick
Publications - 38
Citations - 1210
J. D. Horton is an academic researcher from University of New Brunswick. The author has contributed to research in topics: Binary tree & Tree (set theory). The author has an hindex of 15, co-authored 38 publications receiving 1142 citations. Previous affiliations of J. D. Horton include University of Waterloo & Simon Fraser University.
Papers
More filters
Journal ArticleDOI
A polynomial-time algorithm to find the shortest cycle basis of a graph
TL;DR: An algorithm is given that finds a cycle basis with the shortest possible length in $O(m^3 n)$ operations, which is the first known polynomial-time algorithm for this problem.
Journal ArticleDOI
Sets with no empty convex 7-gons
TL;DR: In this paper, it was shown that g(n) does not exist for n ≥ l and whether g(6) exists for n ≤ l. Arbitrarily large sets containing no empty convex 7-gon are constructed.
Journal ArticleDOI
Minimum edge dominating sets
J. D. Horton,K. Kilakos +1 more
TL;DR: The edge domination problem is NP-complete for planar bipartite graphs, their subdivision, line, and total graphs, perfect claw-free graphs, and planar cub...
Proceedings ArticleDOI
On the number of distributed measurement points for network tomography
TL;DR: In this article, the minimum number of required beacons on a network under a BGP-like routing policy is shown to be NP-hard and at best Ω(log n)-approximable.
Book ChapterDOI
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
Alexander Golynski,J. D. Horton +1 more
TL;DR: An algorithm is given to solve the minimum cycle basis problem for regular matroids based upon Seymour's decomposition theorem, the Gomory-Hu tree, which is essentially the solution for cographicMatroids; and the corresponding result for graphs.