: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...