Results 281 to 290 of about 33,621 (316)
Discovering Classical Spin Liquids by Topological Search of High Symmetry Nets. [PDF]
ACS Cent SciPaddison JAM, Cliffe MJ.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Colorful path detection in vertex-colored temporal
Network Science, 2023AbstractFinding paths is a fundamental problem in graph theory and algorithm design due to its many applications. Recently, this problem has been considered on temporal graphs, where edges may change over a discrete time domain. The analysis of graphs has also taken into account the relevance of vertex properties, modeled by assigning to vertices ...
Dondi, Riccardo +1 more
openaire +3 more sources
Triangulating Vertex-Colored Graphs
SIAM Journal on Discrete Mathematics, 1994This paper examines the class of vertex-colored graphs that can be triangulated without the introduction of edges between vertices of the same color. This is related to the perfect phylogeny problem. An algorithm based on dynamic programming is proposed to solve the problem.
Tandy Warnow +2 more
openaire +3 more sources
Tropical Paths in Vertex-Colored Graphs
Journal of Combinatorial Optimization, 2017A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the initial graph. In this work we study the problem of finding tropical paths in vertex-colored graphs. There are two versions for this problem: the shortest tropical path problem (STPP), i.e., finding a tropical path with the minimum total weight, and the ...
Cohen, Johanne +5 more
openaire +4 more sources
Maximum Colorful Cycles in Vertex-Colored Graphs
2018In this paper, we study the problem of finding a maximum colorful cycle a vertex-colored graph. Specifically, given a graph with colored vertices, the goal is to find a cycle containing the maximum number of colors. We aim to give a dichotomy overview on the complexity of the problem.
Italiano, Giuseppe +3 more
openaire +4 more sources
Vertex-Colored Encompassing Graphs
Graphs and Combinatorics, 2013It is shown that every disconnected vertex-colored plane straight line graph with no isolated vertices can be augmented (by adding edges) into a connected plane straight line graph such that the new edges respect the coloring and the degree of every vertex increases by at most two.
Hoffmann Michael, Tóth Csaba D.
openaire +1 more source
Maximum Colorful Cliques in Vertex-Colored Graphs
2018In this paper we study the problem of finding a maximum colorful clique in vertex-colored graphs. Specifically, given a graph with colored vertices, we wish to find a clique containing the maximum number of colors. Note that this problem is harder than the maximum clique problem, which can be obtained as a special case when each vertex has a different ...
Italiano, Giuseppe +3 more
openaire +2 more sources
Distributed Game-Theoretic Vertex Coloring
2010We exploit the game-theoretic ideas presented in [12] to study the vertex coloring problem in a distributed setting. The vertices of the graph are seen as players in a suitably defined strategic game, where each player has to choose some color, and the payoff of a vertex is the total number of players that have chosen the same color as its own.
CHATZIGIANNAKIS, IOANNIS +3 more
openaire +2 more sources