Results 181 to 190 of about 1,532 (205)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs [PDF]

open access: green
Argyrios Deligkas   +5 more
openalex   +1 more source

Measuring the complexity of directed graphs: A polynomial-based approach. [PDF]

open access: yesPLoS One, 2019
Dehmer M   +8 more
europepmc   +1 more source

On Compiling Structured CNFs to OBDDs. [PDF]

open access: yesTheory Comput Syst, 2017
Bova S, Slivovsky F.
europepmc   +1 more source

Bidimensional parameters and local treewidth

open access: gold, 2009
Erik D. Demaine   +2 more
openalex   +1 more source

Home - About - Disclaimer - Privacy