Results 111 to 120 of about 278 (179)

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 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

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

Quantum-augmented graph differential geometry enhances accuracy in protein-protein interaction prediction. [PDF]

Sci Rep
Karthick V, Alshammari FS, Jayasimman IP, Besi PR, Akgul A.   +4 more
europepmc   +1 more source

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

The complexity of frugal colouring. [PDF]

Arab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

Leveraging graphical model techniques to study evolution on phylogenetic networks. [PDF]

Philos Trans R Soc Lond B Biol Sci
Teo B, Bastide P, Ané C.
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