Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-6
|
Results: 6
A polynomial algorithm for the strong Helly property
Authors:
Bretto, A Ubeda, S Zerovnik, J
Citation:
A. Bretto et al., A polynomial algorithm for the strong Helly property, INF PROCESS, 81(1), 2002, pp. 55-57
An algorithm for k-convex closure and an application
Authors:
Pisanski, T Zmazek, B Zerovnik, J
Citation:
T. Pisanski et al., An algorithm for k-convex closure and an application, INT J COM M, 78(1), 2001, pp. 1-11
Minimum 2-terminal routing in 2-jump circulant graphs
Authors:
Robic, B Zerovnik, J
Citation:
B. Robic et J. Zerovnik, Minimum 2-terminal routing in 2-jump circulant graphs, COMPUT A IN, 19(1), 2000, pp. 37-46
On the linear K-arboricity of cubic graphs
Authors:
Vesel, A Zerovnik, J
Citation:
A. Vesel et J. Zerovnik, On the linear K-arboricity of cubic graphs, INT J COM M, 75(4), 2000, pp. 431-444
Szeged index of symmetric graphs
Authors:
Zerovnik, J
Citation:
J. Zerovnik, Szeged index of symmetric graphs, J CHEM INF, 39(1), 1999, pp. 77-80
Computing the determinant and the algebraic structure count in polygraphs
Authors:
Graovac, A Juvan, M Mohar, B Zerovnik, J
Citation:
A. Graovac et al., Computing the determinant and the algebraic structure count in polygraphs, CROAT CHEM, 72(4), 1999, pp. 853-867
Risultati:
1-6
|