On computing an optimal semi-matching. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 250-261 (2011).
1
On computing the minimum 3-path vertex cover and dissociation number of graphs. (English)
Theor. Comput. Sci. 412, No. 50, 7009-7017 (2011).
2
Minimum $k$-path vertex cover. (English)
Discrete Appl. Math. 159, No. 12, 1189-1195 (2011).
3
A generalization of hopcroft-karp algorithm for semi-matchings and covers in bipartite graphs. (English)
Comput. Res. Repos. 2011, Article No. 1103.1091 (2011).
4
On computing an optimal semi-matching (English)
WG, 250-261 (2011).
5
Finding monotone paths in edge-ordered graphs. (English)
Discrete Appl. Math. 158, No. 15, 1624-1632 (2010).
6
Complexity of ascent finding problem (English)
SOFSEM (2), 70-77 (2008).
7
Start
Contact
Print
General Help
