11 citations · 17 across the 12 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.DM2009
Good characterization for path packing in a subclass of Karzanov networks
N. Vanetik
The path packing problem is stated finding the maximum number of edge-disjoint paths between predefined pairs of nodes in an undirected multigraph. Such a multigraph together with…
cs.DM2009
Computing the tree number of a cut-outerplanar graph
Natalia Vanetik
While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tre…
math.RT2009
On a subclass of tame problems
N. Vanetik
In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are c…