Results 141 to 150 of about 13,814 (224)

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

, 2023
Anagnostides I, Lenzen C, Haeupler B, Zuzic G, Gouleakis T.   +4 more
europepmc   +1 more source

Counting Temporal Paths. [PDF]

Algorithmica
Enright J, Meeks K, Molter H.
europepmc   +1 more source

Romeo and Juliet Meeting in Forest Like Regions

, 2023
Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc   +1 more source

Maximum-scoring path sets on pangenome graphs of constant treewidth. [PDF]

Front Bioinform
Brejová B, Gagie T, Herencsárová E, Vinař T.   +3 more
europepmc   +1 more source

A linear time algorithm for finding tree-decompositions of small treewidth

Symposium on the Theory of Computing, 1993
H. Bodlaender
semanticscholar   +1 more source

Achievable sets, brambles, and sparse treewidth obstructions

, 2007
Brian Lucena
openalex   +1 more source

Slim Tree-Cut Width. [PDF]

Algorithmica
Ganian R, Korchemna V.
europepmc   +1 more source

On the expressive power of planar perfect matching and permanents of bounded treewidth matrices

, 2007
Laurent Lyaudet, Pascal Koiran, Uffe Flarup   +2 more
openalex   +2 more sources

Infrared: a declarative tree decomposition-powered framework for bioinformatics. [PDF]

Algorithms Mol Biol
Yao HT, Marchand B, Berkemer SJ, Ponty Y, Will S.   +4 more
europepmc   +1 more source

Critical assessment of synthetic accessibility scores in computer-assisted synthesis planning. [PDF]

J Cheminform, 2023
Skoraczyński G, Kitlas M, Miasojedow B, Gambin A.   +3 more
europepmc   +1 more source