Results 101 to 110 of about 312 (179)

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, Cook, Linda, Feuilloley, Laurent, Pierron, Théo, Zeitoun, Sébastien   +4 more
openaire   +2 more sources

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs

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  

Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]

Nat Commun, 2023
Dong P, Xia K, Xu Y, Elsworth D, Ampuero JP.   +4 more
europepmc   +1 more source

Clustering systems of phylogenetic networks. [PDF]

Theory Biosci, 2023
Hellmuth M, Schaller D, Stadler PF.
europepmc   +1 more source

Forbidden subgraphs in terms of forbidden quantifiers.

Notre Dame Journal of Formal Logic, 1978
openaire   +3 more sources

Forbidden Subgraph Problems with Predictions

In the Online Delayed Connected H-Node-Deletion Problem, an unweighted graph is revealed vertex by vertex and it must remain free of any induced copies of a specific connected induced forbidden subgraph H at each point in time. To achieve this, an algorithm must, upon each occurrence of H, identify and irrevocably delete one or more vertices.
Böckenhauer, Hans-Joachim, Jahn, Melvin, Komm, Dennis, Stocker, Moritz   +3 more
openaire   +2 more sources

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]

Discrete Comput Geom, 2023
Casel K, Fernau H, Grigoriev A, Schmid ML, Whitesides S.   +4 more
europepmc   +1 more source

Factorization norms and an inverse theorem for MaxCut. [PDF]

Math Ann
Balla I, Hambardzumyan L, Tomon I.
europepmc   +1 more source

Orientability of undirected phylogenetic networks to a desired class: practical algorithms and application to tree-child orientation. [PDF]

Algorithms Mol Biol
Urata T, Yokoyama M, Miyaji H, Hayamizu M.   +3 more
europepmc   +1 more source

Single-cell 3D genome reconstruction in the haploid setting using rigidity theory. [PDF]

J Math Biol
Dewar S, Grasegger G, Kubjas K, Mohammadi F, Nixon A.   +4 more
europepmc   +1 more source