41. Set graphs. II. Complexity of set graph recognition and similar problemsMartin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2014, original scientific article Keywords: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code Published in RUP: 03.04.2017; Views: 2326; Downloads: 131 Link to full text |
42. |
43. Odčitljivost digrafov in dvodelnih grafov : zaključna nalogaVladan Jovičić, 2016, undergraduate thesis Keywords: readability, overlap graph, labeling, integer linear program, distinctness, decomposition, HUB-number, two-dimensional grid graphs, toroidal grid graphs Published in RUP: 09.08.2016; Views: 2616; Downloads: 38 Link to full text This document has more files! More... |
44. |
45. |
46. Vector connectivity in graphsMartin Milanič, Endre Boros, Ferdinando Cicalese, Pinar Heggernes, Pim Van 't Hof, Romeo Rizzi, 2014, published scientific conference contribution abstract (invited lecture) Keywords: vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa, vector connectivity, approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees Published in RUP: 15.10.2015; Views: 3231; Downloads: 250 Link to full text |
47. On the spectral radius of unicyclic graphs with prescribed degree sequenceFrancesco Belardo, Enzo M. Li Marzi, Slobodan Simić, JianFeng Wang, 2010, published scientific conference contribution Keywords: grafi, spektri, zaporedje stopenj, graphs, specters, degree sequence Published in RUP: 15.10.2015; Views: 2393; Downloads: 153 Link to full text |
48. On graphs whose Laplacian index does not exceed 4.5JianFeng Wang, Francesco Belardo, Qiongxiang Huang, Enzo M. Li Marzi, 2013, original scientific article Keywords: lastna vrednost, Laplacova matrika, grafi, eigenvalue, Laplacian matrix, graphs Published in RUP: 15.10.2015; Views: 3263; Downloads: 170 Link to full text |
49. On hereditary efficiently dominatable graphsMartin Milanič, 2011, published scientific conference contribution abstract Keywords: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes Published in RUP: 15.10.2015; Views: 3447; Downloads: 245 Link to full text |
50. |