Results 131 to 140 of about 735 (221)

Forbidden Subgraph Problems with Predictions

open access: yes
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   +3 more
openaire   +2 more sources

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

open access: yesJ Math Biol
Dewar S   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy