Zobrazeno 1 - 10
of 615
pro vyhledávání: '"HARTMAN, DAVID"'
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not trivial and its classification is still an open problem. Recently, Gago
Externí odkaz:
http://arxiv.org/abs/2401.00347
The symmetry of complex networks is a global property that has recently gained attention since MacArthur et al. 2008 showed that many real-world networks contain a considerable number of symmetries. These authors work with a very strict symmetry defi
Externí odkaz:
http://arxiv.org/abs/2312.08042
Structural convergence is a framework for convergence of graphs by Ne\v{s}et\v{r}il and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given sequence of gr
Externí odkaz:
http://arxiv.org/abs/2310.07045
Autor:
Hladík, Milan, Hartman, David
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth, so hard to
Externí odkaz:
http://arxiv.org/abs/2307.03510
Ne\v{s}et\v{r}il and Ossona de Mendez recently proposed a new definition of graph convergence called structural convergence. The structural convergence framework is based on the probability of satisfaction of logical formulas from a fixed fragment of
Externí odkaz:
http://arxiv.org/abs/2212.10985
We consider the classical sensor scheduling problem for linear systems where only one sensor is activated at each time. We show that the sensor scheduling problem has a close relation to the sensor design problem and the solution of a sensor schedule
Externí odkaz:
http://arxiv.org/abs/2110.08924