Zhivko Prodanov Nedev: An algorithm for finding a nearly minimal balanced set in Fp. Math. Comput. 78(268): 2259-2267 (2009); 2008.

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar GraphsZhivko Prodanov Nedev, Peter T.

I teach Computer Science and do research in Computer Science and Mathematics. Research interests: Theoretical Computer Science, Algorithms, Game Theory,…

Information about the author Zhivko Prodanov Nedev will soon be added to the site. ... In this paper we show that the following problem, the even simple path (ESP) ...

ZHIVKO PRODANOV NEDEV. Fig. 5. Two simple paths, one even and one odd, between s and t. COROLLARY. If we have the situation of Lemma 1, we can derive F0. ⊂. 6 ...

Finding an Even Simple Path in a Directed Planar Graph. Author: Zhivko Prodanov NedevAuthors Info & Affiliations. https://doi.org/10.1137/S0097539797330343.

ALGEBRAIC CHARACTERIZATION OF STRONGLY CONNECTED GRAPHS · Z. Nedev · Published 2012 · Mathematics · International journal of pure and applied mathematics.

Finding an Even Simple Path in a Directed Planar Graph. Author: Zhivko Prodanov NedevAuthors Info & Claims. SIAM Journal on Computing, Volume 29, Issue 2.

Sign in · For my personal use · For work or my business.