Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 9
Extreme hollow hexagons with respect to the Mostar index
Roberto Cruz, Andrés Santamaría-Galvis
Izvirni znanstveni članek
Oznake: Mostar index;hollow hexagons;cut method;extremal values;
The Mostar index of a connected graph is a well-known distance-based topologicalindex. Hollow hexagons are coronoid systems that represent coronoid hydrocarbons be-longing to the class of cycloarenes. They are formed by a single chain in a macro-cyclicarrangement consisting of linearly and angularly ...
Leto: 2025 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Extremal values of vertex-degree-based topological indices of coronoid systems
Roberto Cruz, Andrés Santamaría-Galvis, Juan Rada
Izvirni znanstveni članek
Oznake: topological indices;coronoid systems;vertex-degree-based topological indices;
Leto: 2021 Vir: Univerza na Primorskem (UP)
Shellings from relative shellings
Russell Stephen Woodroofe, Andrés Santamaría-Galvis
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake: shelling;relative simplicial complex;NP-completeness;
Leto: 2021 Vir: Univerza na Primorskem (UP)
Shellings from relative shellings, with an application to NP-completeness
Andrés Santamaría-Galvis, Russell Stephen Woodroofe
Izvirni znanstveni članek
Oznake: shellability;computational complexity;simplicial complex;
Leto: 2021 Vir: Univerza na Primorskem (UP)
Razdeljivost in olupljivost relativnih simplicialnih kompleksov
Andrés Santamaría-Galvis, Russell Stephen Woodroofe
Doktorska disertacija
Oznake: shellability;partitionability;relative simplicial complex;real projective plane;dunce hat;NP-completeness;
Leto: 2022 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units
Christian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz Rodes
Objavljeni znanstveni prispevek na konferenci
Oznake: graph theory;graphics processing units;parallel algorithms;CUDA;Thrust library;interval graphs;maximal clique;
Leto: 2014 Vir: Univerza na Primorskem (UP)
Parallelizing an algorithm to decide if a bipartite graph is shellable
Andrés Santamaría-Galvis, Roberto Cruz Rodes, Christian Trefftz, John W. Branch
Objavljeni znanstveni prispevek na konferenci
Oznake: graph theory;parallel algorithms;shellability;
Leto: 2013 Vir: Univerza na Primorskem (UP)
Parallelizing an experiment to decide shellability on bipartite graphs using apache spark
Julián D. Arango-Holguín, Milena Cárdenas-Álzate, Andrés Santamaría-Galvis
Objavljeni znanstveni prispevek na konferenci
Oznake: Apache Hadoop;Apache Spark;bipartite graph shellability;parallel experiments;
Leto: 2016 Vir: Univerza na Primorskem (UP)
Paralelización de un experimento para determinar la escalonabilidad de grafos bipartitos usando Apache Spark
Julián D. Arango-Holguín, Milena Cárdenas-Álzate, Andrés Santamaría-Galvis
Izvirni znanstveni članek
Oznake: Apache Hadoop;Apache Spark;bipartite graph shellability;parallel experiments;
Leto: 2017 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 9
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: