Results 91 to 100 of about 278 (179)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries [PDF]

Logical Methods in Computer Science
We show that the problem of whether a query is equivalent to a query of tree-width $k$ is decidable, for the class of Unions of Conjunctive Regular Path Queries with two-way navigation (UC2RPQs).
Diego Figueira, Rémi Morvan
doaj   +1 more source

On Treewidth and Stable Marriage

CoRR, 2017
Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SESM), Balanced Stable Marriage (BSM), max-Stable Marriage with Ties (max-SMT) and min-Stable Marriage with Ties (min-SMT) problems.
Sushmita Gupta, Saket Saurabh 0001, Meirav Zehavi   +2 more
openaire   +2 more sources

Heuristic computation of exact treewidth

CoRR, 2022
We are interested in computing the treewidth $\tw(G)$ of a given graph $G$. Our approach is to design heuristic algorithms for computing a sequence of improving upper bounds and a sequence of improving lower bounds, which would hopefully converge to $\tw(G)$ from both sides.
openaire   +4 more sources

Approximating the Treewidth of AT-Free Graphs

Discrete Applied Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouchitté, Vincent, Todinca, Ioan
openaire   +4 more sources

Cop-width, flip-width and strong colouring numbers [PDF]

Discrete Mathematics & Theoretical Computer Science
Cop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width.
Robert Hickingbotham
doaj   +1 more source

The treewidth and pathwidth of hypercubes

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran, Telikepalli Kavitha
openaire   +1 more source

Fast simulation of planar Clifford circuits [PDF]

Quantum
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer   +3 more
doaj   +1 more source

Causal Unit Selection using Tractable Arithmetic Circuits

Proceedings of the International Florida Artificial Intelligence Research Society Conference
The unit selection problem aims to find objects, called units, that optimize a causal objective function which describes the objects' behavior in a causal context (e.g., selecting customers who are about to churn but would most likely change their mind ...
Haiying Huang, Adnan Darwiche
doaj   +1 more source

The Treewidth of Java Programs

, 2002
Intuitively, the treewidth of a graph $G$ measures how close $G$ is to being a tree. The lower the treewidth, the faster we can solve various optimization problems on $G$, by dynamic programming along the tree structure. In the paper M.Thorup, All Structured |Programs have Small Tree-Width and Good Register Allocation [8] it is shown that the control ...
Gustedt, Jens, Maehle, Ole A., Telle, Jan Arne   +2 more
openaire   +3 more sources

The algorithmic theory of treewidth

Electronic Notes in Discrete Mathematics, 2000
Abstract Treewidth is a graph measure with several applications. In this abstract, it is discussed that many otherwise intractable problems become polynomial or linear time solvable when restricted to graphs of bounded treewidth, and some other algorithmic results that use treewidth (e.g., applied to planar graphs) are discussed.
openaire   +1 more source