Search Results - "parameterised complexity"

The challenges of unbounded treewidth in parameterised subgraph counting problems by Meeks, Kitty

“…Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent…”
Get full text

Parameterised temporal exploration problems by Erlebach, Thomas, Spooner, Jakob T.

“…We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal…”
Get full text

Defensive alliances in graphs by Gaikwad, Ajinkya, Maity, Soumen

“…A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbours are in S. We study the parameterised…”
Get full text

A new temporal interpretation of cluster editing by Bocci, Cristiano, Capresi, Chiara, Meeks, Kitty, Sylvester, John

“…The NP-complete graph problem Cluster Editing seeks to transform a static graph into a disjoint union of cliques by making the fewest possible edits to the…”
Get full text

Constrained flows in networks by Bang-Jensen, J., Bessy, S., Picasarri-Arrieta, L.

“…The support of a flow x in a network is the subdigraph induced by the arcs uv for which x(uv)>0. We discuss a number of results on flows in networks where we…”
Get full text

The parameterised complexity of counting connected subgraphs and graph motifs by Jerrum, Mark, Meeks, Kitty

“…We introduce a family of parameterised counting problems on graphs, p-#Induced Subgraph With Property(Φ), which generalises a number of problems which have…”
Get full text

Flip-width: Cops and Robber on dense graphs by Torunczyk, Szymon

“…We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width…”
Get full text

Parameterised counting complexity theory by Roth, Marc

“…A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity…”
Get full text

Courcelle's theorem for triangulations by Burton, Benjamin A., Downey, Rodney G.

“…In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved…”
Get full text

Parameterised and Fine-Grained Subgraph Counting, Modulo 2 by Goldberg, Leslie Ann, Roth, Marc

“…Given a class of graphs H , the problem ⊕ Sub ( H ) is defined as follows. The input is a graph H ∈ H together with an arbitrary graph G . The problem is to…”
Get full text

The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation by Enright, Jessica, Lee, Duncan, Meeks, Kitty, Pettersson, William, Sylvester, John

“…Understanding spatial correlation is vital in many fields including epidemiology and social science. Lee et al. (Stat Comput 31(4):51, 2021…”
Get full text

Parameterised complexity of model checking and satisfiability in propositional dependence logic by Mahmood, Yasir, Meier, Arne

“…Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations…”
Get full text

New Frontiers in Parameterized Complexity and Algorithms

“…The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new…”
Get full text

A Fixed-Parameter Perspective on #BIS by Curticapean, Radu, Dell, Holger, Fomin, Fedor, Goldberg, Leslie Ann, Lapinskas, John

“…The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the…”
Get full text

Consensus Strings with Small Maximum Distance and Small Distance Sum by Bulteau, Laurent, Schmid, Markus L.

“…The parameterised complexity of various consensus string problems ( Closest String , Closest Substring , Closest String with Outliers ) is investigated in a…”
Get full text

Exact and approximate algorithms for clustering problem in wireless sensor networks by Yarinezhad, Ramin, Hashemi, Seyed Naser

“…Clustering is an effective method for improving the network lifetime and the overall scalability of a wireless sensor network. The problem of balancing the…”
Get full text

Parameterised Enumeration for Modification Problems by Creignou, Nadia, Ktari, Raïda, Meier, Arne, Müller, Julian-Steffen, Olive, Frédéric, Vollmer, Heribert

“…Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class DelayFPT into parameterised complexity theory in order to capture the notion of…”
Get full text

The parameterised complexity of list problems on graphs of bounded treewidth by Meeks, Kitty, Scott, Alexander

“…We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge…”
Get full text

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem by Pourhassan, Mojgan, Neumann, Frank

“…The generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem for which metaheuristics, such as local search and…”
Get more information

On the Parameterised Complexity of String Morphism Problems by Fernau, Henning, Schmid, Markus L., Villanger, Yngve

“…Given a source string u and a target string w , to decide whether w can be obtained by applying a string morphism on u (i. e., uniformly replacing the symbols…”
Get full text