| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Strong edge geodetic problem in networks
Paul Manuel, Sandi Klavžar, Antony Xavier, Andrew Arokiaraj, Elizabeth Thomas, 2017, izvirni znanstveni članek

Opis: Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. Here we introduce a variation of the geodetic problem and call it strong edge geodetic problem. We illustrate how this problem is evolved from social transport networks. It is shown that the strong edge geodetic problem is NP-complete. We derive lower and upper bounds for the strong edge geodetic number and demonstrate that these bounds are sharp. We produce exact solutions for trees, block graphs, silicate networks and glued binary trees without randomization.
Ključne besede: geodetic problem, strong edge geodetic problem, computational complexity, transport networks
Objavljeno v DKUM: 03.11.2017; Ogledov: 1194; Prenosov: 448
.pdf Celotno besedilo (657,86 KB)
Gradivo ima več datotek! Več...

2.
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
Boštjan Brešar, Sandi Klavžar, Douglas F. Rall, 2007, izvirni znanstveni članek

Opis: Pakirno kromatično število ▫$chi_{rho}(G)$▫ grafa ▫$G$▫ je najmanjše število ▫$k$▫, tako da lahko množico vozlišč grafa ▫$G$▫ razbijemo v pakiranja s paroma različnimi širinami. Dobljenih je več spodnjih in zgornjih meja za pakirno kromatično število kartezičnega produkta grafov. Dokazano je, da pakirno kromatično število šestkotniške mreže leži med 6 in 8. Optimalne spodnje in zgornje meje so dokazane za subdividirane grafe. Obravnavana so tudi drevesa ter vpeljana monotona barvanja.
Ključne besede: matematika, teorija grafov, pakirno kromatično število, kartezični produkt grafov, šestkotniška mreža, subdividiran graf, drevo, računska zahtevnost, mathematics, graph theory, packing chromatic number, Cartesian product of graphs, hexagonal lattice, subdivision graph, tree, computational complexity
Objavljeno v DKUM: 10.07.2015; Ogledov: 1320; Prenosov: 157
URL Povezava na celotno besedilo

3.
Encyclopedia of complexity and systems science
slovar, enciklopedija, leksikon, priročnik, atlas, zemljevid

Opis: Encyclopedia of Complexity and Systems Science provides an authoritative single source for understanding and applying the concepts of complexity theory together with the tools and measures for analyzing complex systems in all fields of science and engineering. The science and tools of complexity and systems science include theories of self-organization, complex systems, synergetics, dynamical systems, turbulence, catastrophes, instabilities, nonlinearity, stochastic processes, chaos, neural networks, cellular automata, adaptive systems, and genetic algorithms. Examples of near-term problems and major unknowns that can be approached through complexity and systems science include: The structure, history and future of the universe; the biological basis of consciousness; the integration of genomics, proteomics and bioinformatics as systems biology; human longevity limits; the limits of computing; sustainability of life on earth; predictability, dynamics and extent of earthquakes, hurricanes, tsunamis, and other natural disasters; the dynamics of turbulent flows; lasers or fluids in physics, microprocessor design; macromolecular assembly in chemistry and biophysics; brain functions in cognitive neuroscience; climate change; ecosystem management; traffic management; and business cycles. All these seemingly quite different kinds of structure formation have a number of important features and underlying structures in common. These deep structural similarities can be exploited to transfer analytical methods and understanding from one field to another. This unique work will extend the influence of complexity and system science to a much wider audience than has been possible to date.
Ključne besede: cellular automata, complex networks, computational nanoscience, ecological complexity, ergodic theory, fractals, game theory, granular computing, graph theory, intelligent systems, perturbation theory, quantum information science, system dynamics, traffic management, chaos, climate modelling, complex systems, dynamical sistems, fuzzy theory systems, nonlinear systems, soft computing, stochastic processes, synergetics, self-organization, systems biology, systems science
Objavljeno v DKUM: 01.06.2012; Ogledov: 2813; Prenosov: 129
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.08 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici