Buscar
Mostrando ítems 51-60 de 1921
Quantile graphs for the characterization of chaotic dynamics in time series
(Ieee, 2015-01-01)
Recently, a map from time series to networks with an approximate inverse operation has been proposed [1], allowing the use network statistics to characterize time series and time series statistics to characterize networks. ...
Quantile graphs for the characterization of chaotic dynamics in time series
(2016-06-01)
Recently, a map from time series to networks with an approximate inverse operation has been proposed [1], allowing the use network statistics to characterize time series and time series statistics to characterize networks. ...
On coloring problems with local constraints
(Elsevier, 2012-04)
We deal with some generalizations of the graph coloring problem on classes of perfect graphs. Namely we consider the μ-coloring problem (upper bounds for the color on each vertex), the precoloring extension problem (a ...
On balanced graphs
(SPRINGER, 2006-02)
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced ...
On the facets of the lift-and-project relaxations of graph subdivisions
(Elsevier, 2011-08)
We study the behavior of lift-and-project procedures for solving combinatorial optimization problems as described by Lovász and Schrijver (1991), in the context of the stable set problem on graphs. Following the work of ...
On the complexity of the {k}-packing function problem
(Blackwell Publishers, 2017-01)
Given a positive integer k, the “ {k} -packing function problem” ({k} PF) is to find in a given graph G, a function f that assigns a nonnegative integer to the vertices of G in such a way that the sum of {k} over each ...
Automatic character recognition based on graph theory: a new approach to automation
(ECSTenerife, Spain, 2011)
The aim of this paper is to present a new method Optical Character
Recognition (OCR).
For it will be used for projections of images and the technique of
Dijkstra's shortest path in graph-based structures can To validate ...
An Architecture and Platform for Developing Distributed Recommendation Algorithms on Large-Scale Social Networks
(Sage Publications Ltd, 2015-06)
The creation of new and better recommendation algorithms for social networks is currently receiving much attention owing to the increasing need for new tools to assist users. The volume of available social data as well as ...
Spectra of graphs obtained by a generalization of the join graph operationDISCRETE MATHEMATICSDISCRETE MATH
(ELSEVIER SCIENCE BV, 2013)
How to build a brick
(Elsevier Science BvAmsterdamHolanda, 2006)