Zobrazeno 1 - 10
of 346
pro vyhledávání: '"Diaz, Josep"'
An edge-colored multigraph $G$ is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the context of multilayered networks we introduce the notion of multilayer
Externí odkaz:
http://arxiv.org/abs/2407.12323
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving upper bounds o
Externí odkaz:
http://arxiv.org/abs/2211.03206
We introduce and analyse a Dynamic Random Graph with Vertex Removal (DRGVR) defined as follows. At every step, with probability $p > 1/2$ a new vertex is introduced, and with probability $1-p$ a vertex, chosen uniformly at random among the present on
Externí odkaz:
http://arxiv.org/abs/2207.05046
Publikováno v:
In European Journal of Combinatorics October 2024 121
Publikováno v:
In Discrete Applied Mathematics 15 September 2024 354:146-159
Publikováno v:
In Journal of Computer and System Sciences September 2024 144
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We consider th
Externí odkaz:
http://arxiv.org/abs/2107.14323
We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,\varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph ($G_\varphi)$ in
Externí odkaz:
http://arxiv.org/abs/2103.12899
List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k}. The problem is known to be NP-hard even for k=3 within the class of
Externí odkaz:
http://arxiv.org/abs/2002.02729