Žerovnik, Janez, 1958-
Žerovnik, Janez, kemičar
Žerovnik, Janez
Janez Žerovnik Slovene mathematician
VIAF ID: 107986360 ( Personal )
Permalink: http://viaf.org/viaf/107986360
Preferred Forms
- 100 0 _ ‡a Janez Žerovnik ‡c Slovene mathematician
- 100 1 _ ‡a Žerovnik, Janez
-
-
-
- 100 1 _ ‡a Žerovnik, Janez ‡d 1958-
- 100 1 _ ‡a Žerovnik, Janez, ‡d 1958-
-
4xx's: Alternate Name Forms (10)
Works
Title | Sources |
---|---|
2-lokalni 4/3-aproksimacijski algoritem za večbarvanje heksagonalnih grafov. | |
Adapting temperature for some randomized local search algorithms | |
Analysis of the mean field annealing algorithm for graph colouring | |
Barvanje grafov z dodajanjem povezav. | |
Behzad-Vizing conjecture and Cartesian-product graphs | |
Chinese postman problem with priority nodes | |
Comparison of asymptotic behaviour of two randomised heuristic approaches | |
Computing the diameter in multiple-loop networks | |
A counterexample to the uniform shortest path routing conjecture for vertex-transitive graphs | |
Editorial | |
Fault diameters of graph products and bundles | |
Formulas for various domination numbers of products of paths and cycles | |
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra | |
Graph colouring by maximal evidence edge adding | |
Homomorphisms of hexagonal graphs to odd cycles | |
Improved lower bound on the Shannon capacity of C [sub] 7 | |
Inherent parallelism analysis of an algorithm through its data flow graph | |
Matematika | |
The obnoxious center problem on weighted cactus graphs | |
On the linear k-arboricity of cubic graphs | |
On the oriented network design problem | |
On the sequential ordering problems | |
On the weak reconstruction of strong product graphs | |
On vulnerability measures of networks | |
One-local 33/24-competitive algorithm for multicoloring hexagonal graphs | |
Optimal permutation routing on mesh networks | |
Partial cubes are distance graphs | |
Perfect codes in direct products of cycles - a complete characterization | |
Polinomski algoritem za krepko Hellyjevo lastnost. | |
A polynomial algorithm for the strong Helly property | |
Posplošeni spiralni algoritem za kodiranje fulerenov in drugih kubičnih poliedrov. | |
Predgovor. | |
Preface | |
Prilagajanje temperature za verjetnostne verzije lokalne optimizacije. | |
Problem nezaželenega centra na obteženih kaktus grafih. | |
O problemu kitajskega poštarja s prioritetnimi vozlišci [!] | |
O problemu zaporednega urejanja. | |
Protiprimer za domnevo o obstoju enakomernega usmerjanja. | |
Računanje premera krožnih grafov. | |
A randomised heuristical algorithm for estimating the chromatic number of a graph | |
Randomized heuristics for combinatorial optimization based on local search | |
O razbitju kubičnih grafov na k-linearne gozdove. | |
Razpoznavanje krepkih grafovskih svežnjev. | |
Razvoj naravoslovnih kompetenc | |
Recognizing weighted directed Cartesian graph bundles | |
Regularne grafe je "težko" pobarvati. | |
Retracts of strong graph bundles | |
Rimsko dominantno število kartezičnega produkta poti in ciklov. | |
Šibka rekonstrukcija krepkega produkta grafov. | |
Simetrijske grupe končnih vzorcev | |
A simple algorithm for factoring a Cartesian-product graph | |
Simplified computation of matchings in polygraphs | |
Simulated annealing type metaheuristics - to cool or not to cool | |
Some applications of graph theory in computer networks and telecommunications | |
Strojniški priročnik | |
Structural information and communication complexity : 16th International Colloquium, Sirocco 2009, Piran, Slovenia, May 25-27, 2009 : revised selected papers | |
Symmetry groups of finite patterns | |
Teorija grafov. | |
Topological graph theory and invariants of graphs. | |
Večbarvanja trikotniških grafov brez induciranih trikotnikov s 5 barvami. | |
Verjetnost v kombinatorični optimizaciji : doktorska disertacija | |
Verjetnostni hevristični algoritem za oceno barvnosti grafa. | |
Vzporedna varianta hevrističnega algoritma za barvanje grafa. | |
O vzporednem algoritmu "ohlajanje". | |
WAW 2011 | |
Weights on edges of chemical graphs determined by paths | |
Zbirka maturitetnih nalog z rešitvami | |
Zgornje meje za razmah frekvenčnega načrta na heksagonalnih grafih. |