Results 161 to 170 of about 11,505 (254)

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]

Algorithmica, 2021
Novotná J, Okrasa K, Pilipczuk M, Rzążewski P, van Leeuwen EJ, Walczak B.   +5 more
europepmc   +1 more source

Welfare optimization for resource allocation with peer effects. [PDF]

PNAS Nexus
Qiu Z, Rosenkrantz DJ, Jackson MO, Levin SA, Ravi SS, Stearns RE, Marathe MV.   +6 more
europepmc   +1 more source

On the Number of Labeled Graphs of Bounded Treewidth

, 2017
Julien Baste, Marc Noy, Ignasi Sau
openalex   +2 more sources

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]

Algorithmica
Blažej V, Jana S, Ramanujan MS, Strulo P.   +3 more
europepmc   +1 more source

Infrared: a declarative tree decomposition-powered framework for bioinformatics

, 2023
Yao H, Marchand B, Berkemer SJ, Ponty Y, Will S.   +4 more
europepmc   +1 more source

Treewidth

, 1993
This thesis focuses on problems related to treewidth and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The treewidth of a graph is a good indication whether one can obtain a solution within reasonable time. A necessary ingredient is a treedecomposition of the graph with small width.
openaire   +1 more source

On low treewidth graphs and supertrees [PDF]

, 2014
Alexander Grigoriev, Steven Kelk, Nela Lekić   +2 more
openalex   +1 more source

Exact and parameterized algorithms for choosability. [PDF]

Acta Inform
Bliznets I, Nederlof J.
europepmc   +1 more source

Counting Temporal Paths. [PDF]

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

Advances in Learning Bayesian Networks of Bounded Treewidth [PDF]

, 2014
Siqi Nie, Denis Deratani Mauá, Cassio P. de Campos, Qiang Ji   +3 more
openalex   +1 more source