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 - 8 / 8
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
Circumflex scapular perforator propeller flap for axillary reconstruction
Shirley Potter, Rozita Gulic, Damir Košutić, 2012, kratki znanstveni prispevek

Ključne besede: flap, axillary reconstruction
Objavljeno: 10.07.2015; Ogledov: 217; Prenosov: 7
URL Celotno besedilo (0,00 KB)

3.
Weak k-reconstruction of Cartesian products graphs
Blaž Zmazek, Wilfried Imrich, Janez Žerovnik, 2001, objavljeni povzetek znanstvenega prispevka na konferenci

Opis: Po Ulamovi domnevi je mogoče vsak končen graf ▫$G$▫ rekonstruirati iz množice vseh podgrafov ▫$G$▫ brez ene točke. Znano je, da je mogoče rekonstruirati kartezične produkte. Obravnavan je soroden problem, imenovan šibka rekonstrukcija. Dokazano je, da je mogoče odločiti, ali se da dani graf ▫$H$▫ dobiti iz nekega kartezičnega produkta ▫$g$▫ z odstranitvijo ▫$k$▫ točk, če privzamemo, da ima ▫$G$▫ vsaj ▫$k+1$▫ faktorjev s po ▫$k+1$▫ točkami. V tem rimeru ▫$H$▫ enolično določa ▫$G$▫. Dan je tudi protiprimer za MacAvaneyjevo domnevo.
Ključne besede: matematika, teorija grafov, kartezični produkt, problem rekonstrukcije, sestavljeni grafi, mathematics, graph theory, reconstruction problem, Cartesian product, composite graphs
Objavljeno: 10.07.2015; Ogledov: 287; Prenosov: 3
URL Celotno besedilo (0,00 KB)

4.
On the weak reconstruction of strong product graphs
Blaž Zmazek, Janez Žerovnik, 2003, objavljeni znanstveni prispevek na konferenci

Opis: We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Ključne besede: matematika, teorija grafov, problem rekonstrukcije, šibka rekonstrukcija, krepki produkt grafov, mathematics, graph theory, reconstruction problem, strong product, composite graphs
Objavljeno: 10.07.2015; Ogledov: 239; Prenosov: 3
URL Celotno besedilo (0,00 KB)

5.
Weak reconstruction of strong product graphs
Blaž Zmazek, Janez Žerovnik, 2007, izvirni znanstveni članek

Opis: We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Ključne besede: matematika, teorija grafov, problem rekonstrukcije, šibka rekonstrukcija, krepki produkt grafov, mathematics, graph theory, reconstruction problem, strong product, composite graphs
Objavljeno: 10.07.2015; Ogledov: 220; Prenosov: 9
URL Celotno besedilo (0,00 KB)

6.
7.
Reconstructing 3D curves with euclidean minimal spanning trees
Simon Kolmanič, Nikola Guid, 2006, izvirni znanstveni članek

Opis: In this paper, we present a new efficient algorithm for reconstruction of nonintersecting 3D curves from a sufficiently den se sample. We use the Euclidean minimal spanning trees to identify line segments reconstructing curve shapes. To deal with more than one curve in a sample and to eliminate noisy data, we introduce chains of connected line segments. With the incremental growth based on heuristics, the chains contain finally curve shapes. The method is robust and fast for both 2D and 3D curves.
Ključne besede: oblaki točk, rekonstrukcija krivulj, evklidska minimalna vpeta drevesa, point cloud, curve reconstruction, euclidean minimal spanning trees
Objavljeno: 10.07.2015; Ogledov: 522; Prenosov: 9
URL Celotno besedilo (0,00 KB)

8.
Weak k-reconstruction of Cartesian products
Wilfried Imrich, Blaž Zmazek, Janez Žerovnik, 2003, izvirni znanstveni članek

Opis: By Ulam's conjecture every finite graph ▫$G$▫ can be reconstructed from its deck of vertex deleted subgraphs. The conjecture is still open, but many special cases have been settled. In particular, one can reconstruct Cartesian products. We consider the case of ▫$k$▫-vertex deleted subgraphs of Cartesian products and prove that one can decide whether a graph ▫$H$▫ is a ▫$k$▫-vertex deleted subgraph of a Cartesian product ▫$G$▫ with at least ▫$k+1$▫ prime factors on at least ▫$k+1$▫ vertices each, and that ▫$H$▫ uniquely determines ▫$G$▫. This extends previous works of the authors and Sims. This paper also contains a counterexample to a conjecture of MacAvaney.
Ključne besede: mathematics, graph theory, reconstruction problem, Cartesian product, composite graphs
Objavljeno: 31.03.2017; Ogledov: 388; Prenosov: 22
.pdf Celotno besedilo (197,33 KB)

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