Buscar
Mostrando ítems 11-20 de 1317
Graphs admitting antimagic labeling for arbitrary sets of positive numbers
(Elsevier, 2020)
Hartsfield and Ringel in 1990 conjectured that any connected graph with q >= 2 edges has an edge labeling f with labels in the set {1,..., q}, such that for every two distinct vertices u and v, f(u) not equal= f(v), where ...
Removable paths and cycles with parity constraints
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2014)
Neural network, kernighan-lin and multilevel heuristics for the graph bisection problem on geometrically connected graphs
(Universidad de Los Andes, 2009)
TSP Tours in Cubic Graphs: Beyond 4/3 Read More: http://epubs.siam.org/doi/abs/10.1137/140972925
(Society for Industrial and Applied Mathematics, 2015)
After a sequence of improvements Boyd et al. [TSP on cubic and subcubic graphs, Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 6655, Springer, Heidelberg, 2011, pp. 65-77] proved that any ...
On delta-graphs and delta conjectureSobre delta-grafos y la conjetura delta
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2018)
On the intersection of two longest paths in k-connected graphs
(Pontificia Universidad Católica del Perú, 2021)
Approximation algorithms for connected graph factors of minimum weight
(Springer, 2018)
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of ...
Link prediction in graph construction for supervised and semi-supervised learning
(International Neural Network Society – INNSIEEE Computational Intelligence SocietyKillarney, 2015-07)
Many real-world domains are relational in nature since they consist of a set of objects related to each other in complex ways. However, there are also flat data sets and if we want to apply graph-based algorithms, it is ...
A weaker version of Lovasz' path removal conjecture
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2008)
Fully Dynamic Recognition of Proper Circular-Arc Graphs
(Springer, 2015-04)
We present a fully dynamic algorithm for the recognition of proper circular-arc (PCA) graphs. The allowed operations on the graph involve the insertion and removal of vertices (together with its incident edges) or edges. ...