Results 21 to 30 of about 11,505 (254)
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity [PDF]
Logical Methods in Computer Science, 2019 This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.
Dušan Knop +3 more
doaj +1 more source
On the Treewidth of Dynamic Graphs [PDF]
Theoretical Computer Science, 2013 Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to identify the graph properties that can be preserved over time and understand their respective computability.
Bernard Mans, Luke Mathieson
openaire +3 more sources
Constrained Connectivity in Bounded X-Width Multi-Interface Networks
Algorithms, 2020 As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere.
Alessandro Aloisio, Alfredo Navarra
doaj +1 more source
Embedding phylogenetic trees in networks of low treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a rooted, binary phylogenetic network and a rooted, binary phylogenetic tree, can the tree be embedded into the network? This problem, called \textsc{Tree Containment}, arises when validating networks constructed by phylogenetic inference methods ...
Leo van Iersel +2 more
doaj +1 more source
Patterns with Bounded Treewidth [PDF]
Information and Computation, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Reidenbach, Markus L. Schmid
openaire +2 more sources
Nordhaus–Gaddum for treewidth [PDF]
European Journal of Combinatorics, 2012 We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight.
Gwenaël Joret, David R. Wood
openaire +2 more sources
Quantum speedups for treewidth
CoRR, 2022 In this paper, we study quantum algorithms for computing the exact value of the treewidth of a graph. Our algorithms are based on the classical algorithm by Fomin and Villanger (Combinatorica 32, 2012) that uses $O(2.616^n)$ time and polynomial space. We show three quantum algorithms with the following complexity, using QRAM in both exponential space ...
Kļevickis, Vladislavs +2 more
openaire +4 more sources
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
Mathematics, 2023 The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
doaj +1 more source
Journal of Combinatorial Theory, Series B, 2005 Graphs of high girth have been much studied, especially in the context of the minimum vertex number of graphs of given girth and minimum degree. The authors study the treewidth \(\text{tw}(G)\) of a graph \(G\), giving a lower bound in terms of the girth \(g(G)\) and average degree \(d(G)\). They show that \[ \text{tw}(G)\geq c {1\over g(G)+1} (d(G)-1)^
Chandran, L., Subramanian, C.
openaire +3 more sources
On the treewidth of Hanoi graphs
Theoretical Computer Science, 2022 The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We propose an adversarial variation in which the first player forbids a set of states in the puzzle, and the second player must then convert one randomly-selected state to ...
David Eppstein +2 more
openaire +4 more sources