Tomaz Hocevar

Learn More
MOTIVATION Small-induced subgraphs called graphlets are emerging as a possible tool for exploration of global and local structure of networks and for analysis of roles of individual nodes. One of the obstacles to their wider use is the computational complexity of algorithms for their discovery and counting. RESULTS We propose a new combinatorial method(More)
Janez Demšar JANEZ.DEMSAR@FRI.UNI-LJ.SI Tomaž Curk TOMAZ.CURK@FRI.UNI-LJ.SI Aleš Erjavec ALES.ERJAVE@FRI.UNI-LJ.SI Črt Gorup CRT.GORUP@FRI.UNI-LJ.SI Tomaž Hočevar TOMAZ.HOCEVAR@FRI.UNI-LJ.SI Mitar Milutinovič MITAR.MILUTINOVIC@FRI.UNI-LJ.SI Martin Možina MARTIN.MOZINA@FRI.UNI-LJ.SI Matija Polajnar MATIJA.POLAJNAR@FRI.UNI-LJ.SI Marko Toplak(More)
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly faster than the existing approaches based on direct enumeration of graphlets. The approach presented in this paper presents(More)
H ow fast can you count stars? Not those in the night sky, but stars present in a network. The two types of stars are rather different, but they share some properties. They are both interesting to observe and neither is trivial to count. Social networks might be the most ubiquitous example of networks encountered by an everyday person. However, networks are(More)
  • 1