131. |
132. |
133. 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 |
134. Spread of influence in weighted networks under time and budget constraintsFerdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Joseph Peters, Ugo Vaccaro, 2015, original scientific article Keywords: social networks, spread of influence, viral marketing, dynamic monopolies, exact polynomial time algorithm
Published in RUP: 15.10.2015; Views: 2689; Downloads: 192
Link to full text |
135. Linear separation of connected dominating sets in graphs : (extended abstract)Nina Chiarelli, Martin Milanič, 2014, published scientific conference contribution Keywords: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph
Published in RUP: 15.10.2015; Views: 3400; Downloads: 114
Link to full text |
136. Regular embeddings of cycles with multiple edges revisitedKan Hu, Roman Nedela, Martin Škoviera, Naer Wang, 2015, original scientific article Abstract: Regularne vložitve ciklov z večkratnimi povezavami se pojavljajo v literaturi že kar nekaj časa, tako v topološki teoriji grafov kot tudi izven nje. Ta članek izriše kompletno podobo teh zemljevidov na ta način, da povsem opiše, klasificira in enumerira regularne vložitve ciklov z večkratnimi povezavami tako na orientabilnih kot tudi na neorientabilnih ploskvah. Večina rezultatov je sicer znana v tej ali oni obliki, toda tu so predstavljeni iz poenotenega zornega kota, osnovanega na teoriji končnih grup. Naš pristop daje dodatno informacijo tako o zemljevidih kot o njihovih grupah avtomorfizmov, priskrbi pa tudi dodaten vpogled v njihove odnose.
Keywords: regularna vložitev, večkratna povezava, Hölderjev izrek, Möbiusov zemljevid, regular embedding, multiple edge, Hölder's Theorem, Möbius map
Published in RUP: 15.10.2015; Views: 2812; Downloads: 109
Link to full text |
137. Maximum genus, connectivity, and Nebeský's theoremDan Steven Archdeacon, Michal Kotrbčík, Roman Nedela, Martin Škoviera, 2015, original scientific article Keywords: maksimalen rod, Nebeskýnov rod, Bettijevo število, povezanost, maximum genus, Nebeský theorem, Betti number, connectivity
Published in RUP: 15.10.2015; Views: 2641; Downloads: 149
Link to full text |
138. 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 |
139. |
140. Counterexamples to Orlin's conjecture on equistable graphs : Raziskovalni matematični seminar, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, Koper, 24. 3. 2014Martin Milanič, 2014, other performed works Keywords: ekvistabilni grafi, Orlinova domneva, splošni particijski grafi, protiprimeri, grafi
Published in RUP: 15.10.2015; Views: 2114; Downloads: 37
Link to full text |
