Dec 6, 1991 · There have been a number of results and conjectures regarding the cone, the lattice and the integer cone generated by the (real-valued char-.
Abstract. There have been a number of results and conjectures regarding the cone, the lattice and the integer cone generated by the (real-valued char-.
A Hilbert basis is defined to be a set of vectors S such that every vector in the cone and lat- tice generated by S can also be expressed as a non-negative ...
A vector is dyadic if each of its entries is a dyadic rational number, i.e. of the form $$\frac{a}{2^k}$$ for some integers a, k with $$k\ge 0$$ .
Goddyn – Cones, lattices and Hilbert bases of circuits and perfect matchings [MR 1224721]; Pavol Gvozdjak and Jozef Širáň – Regular maps from voltage ...
Cones, lattices and Hilbert bases of circuits and perfect matchings. Proc. AMS-IMS-SIAM Joint Summer Research Conf. on graph minors (1991, Univ. of ...
Sep 18, 2014 · Cones, lattices and Hilbert bases of circuits and perfect matchings. In Graph structure theory (Seattle, WA, 1991), volume 147 of Contemp.
Feb 6, 2016 · Combinatorially defined Hilbert bases have computational consequences, since membership testing is often easier for the cone and the lattice ...
A Hilbert basis is defined as a to be a set of vectors S such that every vector in the cone and lattice generated by S can also be expressed as a non ...
Missing: circuits perfect matchings.
[30] L. A. Goddyn, Cones, lattices and Hilbert bases of circuits and perfect matching,. Contemp. Math. AMS, 147 (1993), 419-440. [31] L. A. Goddyn, J. van ...