Join Our Newsletter

SIAMDM

2010

9 years 6 months ago
2010

Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...

JSYML

2010

9 years 6 months ago
2010

For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...

JUCS

2010

9 years 10 months ago
2010

: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...

MCSS

2008

Springer

9 years 11 months ago
2008

Springer

In this paper we deal with a perturbed algebraic Riccati equation in an infinite dimensional Banach space. Besides the interest in its own right, this class of equations appears, ...

ML

2002

ACM

9 years 11 months ago
2002

ACM

We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...

COMBINATORICA

2004

9 years 11 months ago
2004

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...

COMBINATORICA

2004

9 years 11 months ago
2004

We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...

NETWORKS

2006

9 years 11 months ago
2006

We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...

INFORMATICALT

2008

9 years 12 months ago
2008

Abstract. A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part i...

CPC

2006

9 years 12 months ago
2006

The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...