Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 9 / 9
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, prispevek na konferenci brez natisa

Najdeno v: ključnih besedah
Povzetek najdenega: ...perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm, ...
Ključne besede: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Objavljeno: 15.10.2013; Ogledov: 1366; Prenosov: 36
URL Polno besedilo (0,00 KB)

2.
A note on domination and independence-domination numbers of graphs
Martin Milanič, 2013, objavljeni znanstveni prispevek na konferenci

Opis: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph
Objavljeno: 15.10.2013; Ogledov: 1224; Prenosov: 61
URL Polno besedilo (0,00 KB)

3.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary...
Ključne besede: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes
Objavljeno: 15.10.2015; Ogledov: 1300; Prenosov: 95
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

4.
Improved algorithms for k-domination and total k-domination in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič, 2018, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: k-domination, total k-domination, proper interval graph, polynomial-time algorithm
Objavljeno: 17.09.2018; Ogledov: 249; Prenosov: 68
URL Polno besedilo (0,00 KB)

5.
Aproksimacijski vidiki vektorske dominacije in vektorske povezanosti v grah
Mirza Krbezlija, 2018, diplomsko delo

Najdeno v: ključnih besedah
Povzetek najdenega: ...graph, vector domination, vector connectivity, submodular set covering problem, approximation...
Ključne besede: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programming
Objavljeno: 17.09.2018; Ogledov: 274; Prenosov: 8
URL Polno besedilo (0,00 KB)

6.
A dichotomy for weighted efficient dominating sets with bounded degree vertices
Andreas Brandstädt, Martin Milanič, 2019, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination,...
Ključne besede: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms
Objavljeno: 21.01.2019; Ogledov: 185; Prenosov: 82
URL Polno besedilo (0,00 KB)

7.
Linear separation of connected dominating sets in graphs
Nina Chiarelli, Martin Milanič, 2019, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split...
Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function
Objavljeno: 04.04.2019; Ogledov: 267; Prenosov: 82
URL Polno besedilo (0,00 KB)

8.
9.
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
Cafer Çalişkan, Štefko Miklavič, Sibel Özkan, 2019

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: domination, efficient domination, perfect code, Cayley graph
Objavljeno: 14.11.2019; Ogledov: 44; Prenosov: 4
URL Polno besedilo (0,00 KB)

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