11 citations · 17 across the 12 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.GR2008
On Borel complexity of the isomorphism problems for graph-related classes of Lie algebras and finite p-groups
Ruvim Lipyanski, Natalia Vanetik
We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional -step nilpotent Lie algebras over a field and…
cs.DM2008
On fractionality of the path packing problem
N. Vanetik
In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths wi…