Results 11 to 20 of about 4,826 (192)
The Complexity of Computing Optimum Labelings for Temporal Connectivity [PDF]
, 2022 A graph is temporally connected if there exists a strict temporal path, i.e., a path whose edges have strictly increasing labels, from every vertex u to every other vertex v.
Spirakis, P.G. +11 more
core +1 more source
Problems on vertex distinguishing edge colorings [PDF]
, 2021 En el presente trabajo analizamos el problema de suma de coloreo de aristas con vértices adyacentes distinguibles. Un coloreo de aristas con vértices adyacentes distinguibles es una asignación de colores a las aristas de un grafo con las siguientes ...
Curcio, Brian Luis
core +2 more sources
SMARANDACHE MULTI-SPACE THEORY, Second Edition [PDF]
, 2011 We are used to the idea that our space has three dimensions: length, breadth and height with time providing the fourth dimension of spacetime by Einstein. In the string or superstring theories, we encounter 10 dimensions.
MAO, Linfan
core +1 more source
International Journal of Mathematical Combinatorics, Vol.3 [PDF]
, 2009 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
International Journal of Mathematical Combinatorics, Vol.4A [PDF]
, 2010 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2011 Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
, 2023 Many everyday optimization problems arise in transportation networks, such as vehicle and pedestrian navigation, truck route planning, or facility location problems in logistics. To solve such problems, efficient algorithms are required. To that end, the
Blum, Johannes
core +1 more source
, 2023 Supervised learning algorithms aims at identifying relationship between inputs and outputs thanks to training sets of couples (input, output). The most studied setting of supervised learning deals with high-dimensional inputs but low-dimensional outputs,
Motte, Luc
core +3 more sources
Chromosome territory position and active relocation in normal and hutchinson-gilford progeria fibroblasts [PDF]
, 2009 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Radial chromosome positioning in interphase nuclei is non-random and can alter according to developmental, differentiation, proliferation or disease status.
Mehta, Ishita Shailesh
core +7 more sources
Construcción de aplicativo web para la gestión y prestación del servicio de ambulancias en la ciudad de Pereira, utilizando inteligencia artificial [PDF]
, 2021 En Colombia en los últimos años se han diseñado e implementado propuestas que pretenden aportar soluciones viables a un problema que es recurrente en la atención prehospitalaria primaria relacionado al servicio de ambulancias, en parte este problema es ...
Henao Motato, Wilson +1 more
core +1 more source