Results 121 to 130 of about 735 (221)
Local certification of forbidden subgraphs
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness ...
Bousquet, Nicolas +4 more
openaire +2 more sources
Informatika, 2018 A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs) [PDF]
, 2019 Artur Czumaj, Christian Sohler
openalex +1 more source
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Discrete Comput Geom, 2023 Casel K +4 more
europepmc +1 more source
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Algorithms Mol Biol, 2023 Marchand B +4 more
europepmc +1 more source
On classes of graphs determined by forbidden subgraphs [PDF]
, 1983 Svatopluk Poljak, Vojtěch Rödl
openalex +1 more source
Existence of $2$-Factors in Tough Graphs without Forbidden Subgraphs [PDF]
, 2022 Elizabeth A. Grimm +2 more
openalex +1 more source
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
, 2015 Konrad K. Dabrowski, Daniël Paulusma
openalex +4 more sources
Genetic networks encode secrets of their past. [PDF]
J Theor Biol, 2022 Crawford-Kahrl P +3 more
europepmc +1 more source