• Publications
  • Influence
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 April 1987
TLDR
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. Expand
Sets with no empty convex 7-gons
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
TLDR
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. Expand
On the number of distributed measurement points for network tomography
TLDR
This paper considers measurements using a distributed set of measurement points or beacons and proposes a relatively small candidate set of beacons for the current Internet topology, which has properties with relevant applications for all-paths routing on the public Internet and performance based routing. Expand
Resolvable Path Designs
  • J. Horton
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1 July 1985
TLDR
It is shown that if v is large enough, then an RBPD exists if and only if v ≡ k2 (modulo lcm(2k − 2, k), and that the categorical product of a k-factorable graph and a regular graph is also k- Factorable. Expand
REMARKS ON THE SPHERE OF INFLUENCE GRAPH
Let S be a finite set of points in the plane. For each point x E S, let r, be the closest distance to any other point in the set, and let C, be the circle of radius r , centered at x. Toussaint hasExpand
Minimum Edge Dominating Sets
TLDR
The edge domination problem is NP-complete for planar bipartite graphs, their subdivision, line, and total graphs, perfect claw-free graphs, and planar cub... Expand
Sub-Latin Squares and Incomplete Orthogonal Arrays
  • J. Horton
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1974
Abstract The main result of this paper is that for any pair of orthogonal Latin squares of side k, there will exist for all sufficiently large n a pair of orthogonal Latin squares with the first pairExpand
Room designs and one-factorizations
The existence of a Room square of order 2n is known to be equivalent to the existence of two orthogonal one-factorizations of the complete graph on 2n vertices, where “orthogonal” means “any twoExpand
Orthogonal starters in finite abelian groups
  • J. Horton
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 February 1990
TLDR
It is shown that all abelian groups G of odd order greater than 5 such that three does not divide the order of G admits a strong starter. Expand
...
1
2
3
4
5
...