Results 191 to 200 of about 13,814 (224)
Measuring the complexity of directed graphs: A polynomial-based approach. [PDF]
PLoS One, 2019 Dehmer M +8 more
europepmc +1 more source
Clifford Algebras Meet Tree Decompositions. [PDF]
Algorithmica, 2019 Włodarczyk M.
europepmc +1 more source
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
, 2017 Dušan Knop +3 more
openalex +2 more sources
On Guarding Orthogonal Polygons with Bounded Treewidth
, 2017 Thérèse Biedl, Saeed Mehrabi
openalex +2 more sources