2 citations · 5 across the 6 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2007
Convex and linear models of NP-problems
Sergey Gubin
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
cs.DM2007
Set Matrices and The Path/Cycle Problem
Sergey Gubin
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
cs.DM2007★ 1 cited
Finding Paths and Cycles in Graphs
Sergey Gubin
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).