Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 6
Competitive evaluation of threshold functions in the priced information model
Ferdinando Cicalese, Martin Milanič
Izvirni znanstveni članek
Oznake: vrednotenje funkcij;kompetitivno razmerje;
Competitive evaluation of threshold functions in the priced information model
Leto: 2011 Vir: Univerza na Primorskem (UP)
Graphs of separability at most 2
Ferdinando Cicalese, Martin Milanič
Objavljeni znanstveni prispevek na konferenci
Oznake: separability;hereditary class;separating clique;decomposition;induced subgraph;induced minor;parsimony haplotyping;
Graphs of separability at most 2
Leto: 2012 Vir: Univerza na Primorskem (UP)
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi
Izvirni znanstveni članek
Oznake: vector connectivity;APX-hardness;NP-hardness;polynomial-time algorithm;block graphs;
On the complexity of the vector connectivity problem
Leto: 2015 Vir: Univerza na Primorskem (UP)
Latency-bounded target set selection in social networks
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Ugo Vaccaro
Izvirni znanstveni članek
Oznake: target set selection;monotone irreversible dynamic monopolies;dynamo;
Latency-bounded target set selection in social networks
Leto: 2014 Vir: Univerza na Primorskem (UP)
Spread of influence in weighted networks under time and budget constraints
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Joseph Peters, Ugo Vaccaro
Izvirni znanstveni članek
Oznake: social networks;spread of influence;viral marketing;dynamic monopolies;exact polynomial time algorithm;
Spread of influence in weighted networks under time and budget constraints
Leto: 2015 Vir: Univerza na Primorskem (UP)
Vector connectivity in graphs
Martin Milanič, Endre Boros, Ferdinando Cicalese, Pinar Heggernes, Pim Van 't Hof, Romeo Rizzi
Objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)
Oznake: vektorska povezanost;aproksimacijski algoritmi;polinomski algoritmi;NP-poln problem;razcepljeni grafi;kografi;drevesa;vector connectivity;approximation algorithms;poynomial time algorithms;NP-hard problem;split graphs;cographs;trees;
Vector connectivity in graphs
Leto: 2014 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 6
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: