We present a deterministic Logspace procedure, which, given a bipartite planar graph on n
vertices, assigns O (log n) bits long weights to its edges so that the minimum weight perfect …

Reachability and shortest path problems are NL-complete for general graphs. They are
known to be in L for graphs of tree-width 2 (Jakoby and Tantau in Proceedings of …

Motivated by the challenge of efficiently reconfiguring distribution networks for power loss
reduction, this study presents an approach for finding a minimum loss radial configuration for …

We consider the problem of counting the number of spanning trees in planar graphs. We
prove tight bounds on the complexity of the problem, both in general and especially in the …

The space 𝒞 of conservative vertex colorings (over a field 𝔽) of a countable, locally finite
graph G is introduced. When G is connected, the subspace 𝒞 0 of based colorings is shown …

On the component number of links from plane graphs Page 1 Journal of Knot Theory and Its
Ramifications Vol. 24, No. 1 (2015) 1520002 (5 pages) c© World Scientific Publishing …

All the trees of the graph are not important, but spanning trees have a special significance in
the analysis of networks and systems. The simplest of the prototype methods is based on …

Given linear representations M1 and M2 of matroids over a field F, we consider the problem
(denoted by ECLR [F]) of checking if M1 and M2 represent the same matroid over F. When …

This thesis studies some combinatorial, topological and linear algebraic parameters
associated with Boolean and arithmetic circuits. It is divided into two parts, the first describes …