WorldCat Identities

Zaveršnik, Matjaž

Overview
Works: 43 works in 51 publications in 2 languages and 55 library holdings
Roles: Author
Publication Timeline
.
Most widely held works by Matjaž Zaveršnik
Analysis and visualization of 2-mode networks by Matjaž Zaveršnik( )

4 editions published in 2001 in English and held by 4 WorldCat member libraries worldwide

2-mode data consist of data matrix $A$ over the sets $U$ (rows) and $V$ (columns). One or both sets can be (very) large. Such data can be viewed also as a (directed) bipartite network. We can analyze 2-mode network directly or transform it into an 1-mode network $U$ over $V$. In the paper we present different approaches to the analysis and visualization of 2-mode networks and illustrate them on real life examples. These approaches are supported in the program Pajek
Razčlembe omrežij : doktorska disertacija by Matjaž Zaveršnik( Book )

1 edition published in 2003 in Slovenian and held by 4 WorldCat member libraries worldwide

Precej znanih postopkov za analizo omrežij je prepočasnih, da bi jih lahko uporabili na velikih omrežjih. Zato si pogosto pomagamo z razčlembo omrežja na manjše in lažje obvladljive dele. V doktorski disertaciji se ukvarjamo z učinkovitimi (podkvadratičnimi) postopki za razčlembe velikih omrežij. V uvodnem poglavju so podane osnovne definicije in oznake, ki jih potrebujemo v nadaljevanju. Drugo poglavje je pregled najbolj znanih že obstoječih postopkov za določanje razčlemb. Opisani so postopki za določanje razbitij danega omrežja, požrešni postopek za izboljšanje dobljenega razbitja in nekaj drugih vrst razčlemb. Tretje, četrto in peto poglavje vsebujejo izvirne prispevke disertacije. V tretjem poglavju definiramo točkovne in povezavne otoke omrežja. Točkovni otok je povezana skupina točk, ki glede na svoje vrednosti izstopa od točk v svoji soseščini. Podobno so definirani tudi povezavni otoki, le da imamo tam vrednosti na povezavah. Opisani so učinkoviti postopki za določanje otokov in dokazanih več njihovih lastnosti. V naslednjih dveh poglavjih sta razvita primera učinkovito izračunljive točkovne in povezavne funkcije. V četrtem poglavju se ukvarjamo s sredicami. Sredica reda $k$ je maksimalen podgraf, v katerem ima vsaka točka vsaj $k$ sosedov. Sredice določajo gnezdeno razslojitev grafa, povezane komponente teh slojev pa določajo hierarhijo nad množico točk. Opisan je učinkovit postopek za določanje sredic. Pojem sredic je posplošen tudi na omrežja, kjer namesto stopnje v dani točki opazujemo kakšno drugo točkovno funkcijo. Pokazano je, da obstaja učinkovit postopek za cel razred točkovnih funkcij. V petem poglavju posplošimo pojem povezanosti v grafu. Definiramo različne relacije povezanosti točk (točkovno in povezavno povezanost s kratkimi cikli v neusmerjanih in usmerjenih grafih). Opazimo, da so nekatere od teh relacij ekvivalenčne relacije na množici točk, druge pa določajo ekvivalenčno relacijo na množici povezav, kar nam spet določa razbitje grafa
Islands by Matjaž Zaveršnik( )

1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide

Nova pristopa k analizi omrežij by Matjaž Zaveršnik( )

1 edition published in 2004 in Slovenian and held by 2 WorldCat member libraries worldwide

Generalized cores by Vladimir Batagelj( Book )

2 editions published in 2002 in English and held by 2 WorldCat member libraries worldwide

Sredice so poleg povezanostnih komponent eden redkih konceptov, ki nam zagotavljajo učinkovito razčlembo velikih grafov in omrežij. V članku je predstavljena posplošitev pojma sredica grafa, ki temelji na funkciji, definirani na točkah grafa. Pokazano je, da za lokalno in monotono funkcijo lahko določimo sredice v času $O(m \max(\Delta,\log n))$
Srečanje z javo by Matjaž Zaveršnik( )

1 edition published in 2004 in Slovenian and held by 2 WorldCat member libraries worldwide

Short cycles connectivity by Vladimir Batagelj( Book )

2 editions published in 2003 in English and held by 2 WorldCat member libraries worldwide

Povezanost s kratkimi cikli je posplošitev navadne povezanosti. Namesto s potjo (zaporedjem povezav) morata biti točki povezani z zaporedjem kratkih ciklov, v katerem morata imeti dva zaporedna cikla vsaj eno skupno točko. Če imajo vsi sosedni cikli v zaporedju vsaj eno skupno povezavo, govorimo o povezavni povezanosti s kratkimi cikli. Pokazano je, da je povezanost s kratkimi cikli ekvivalenčna relacija na množici točk, medtem ko povezavna povezanost s kratkimi cikli določa ekvivalenčno relacijo na množici povezav . Predstavljeni so učinkoviti postopki za določanje ekvivalenčnih razredov. Povezanost s kratkimi cikli lahko definiramo tudi za usmerjene grafe (ciklična in tranzitivna povezanost). Nadaljno posplošitev dobimo, če namesto kratkih ciklov uporabimo majhne klike ali druge družine grafov
Uvod v programski jezik java by Matjaž Zaveršnik( )

1 edition published in 2004 in Slovenian and held by 2 WorldCat member libraries worldwide

Network analysis of texts by Vladimir Batagelj( Book )

2 editions published in 2002 in English and held by 2 WorldCat member libraries worldwide

Two approaches to identify sets of important vertices in large networks by Matjaž Zaveršnik( )

1 edition published in 1999 in English and held by 2 WorldCat member libraries worldwide

Gaussov eliminacijski algoritem na transputerskem sistemu : diplomsko delo by Matjaž Zaveršnik( Book )

1 edition published in 1993 in Slovenian and held by 1 WorldCat member library worldwide

Network analysis of dictionaries by Vladimir Batagelj( Book )

2 editions published in 2002 in English and held by 1 WorldCat member library worldwide

Analysis of collaboration networks by Matjaž Zaveršnik( )

1 edition published in 2002 in English and held by 1 WorldCat member library worldwide

Mathematical netbooks by Vladimir Batagelj( )

1 edition published in 1998 in English and held by 1 WorldCat member library worldwide

Multimedia PCs widely opened the posibility to prepere and use notebooks containing dynamics elements (animation, video, sound, simulations, programmed actions,...). Combined with the network they also lost their closeness -- their parts can be located at different places (computers), sometimes they are spread over the network and there is no clear boundary. In the paper we discuss different technical possibilities that we have when creating such netbooks: HTML, use of (special) helper applications or plug-ins, support libraries written in Java, Javascript templates, transformers to VRML, service programs at servers,... The emphasis is on the development of netbooks with mathematical contents. Our main goal is to provide a teacher with a collection of easy-to-use elements to built their own netbooks
Support of distance learning activities by educational networks by Vladimir Batagelj( )

1 edition published in 2000 in English and held by 1 WorldCat member library worldwide

In the paper we present our experiences and solutions in support of distance learning activities by educational networks accumulated over last years
Important vertices in large directed networks by Matjaž Zaveršnik( )

1 edition published in 1999 in English and held by 1 WorldCat member library worldwide

Založniška dejavnost by Matjaž Zaveršnik( )

1 edition published in 2014 in Slovenian and held by 1 WorldCat member library worldwide

An O(m) algorithm for cores decomposition of networks by Vladimir Batagelj( Book )

1 edition published in 2002 in English and held by 1 WorldCat member library worldwide

MSWLogo and dynamic link libraries by Matjaž Zaveršnik( )

1 edition published in 2001 in English and held by 1 WorldCat member library worldwide

Dynamic link libraries (DLL) are program modules that contain code, data, or resources that can be shared among many Windows applications. In the paper we will show how to use them to extend MSWLogo functionality and how to write our own DLLs. Some short examples of DLLs usage will be given
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.94 (from 0.85 for Uvod v pro ... to 0.98 for Analysis a ...)

Languages