Search Results - Parameterized graph algorithms

A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms by Kowaluk, Mirosław, Lingas, Andrzej

“… The multi-dimensional matrix product framework is useful in the design of parameterized graph algorithms…”
Get full text

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number by Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani, Zehavi, Meirav

“… In this paper, we further strengthen this belief by showing that several cut problems that admit sub-exponential time parameterized algorithms…”
Get full text

A survey of parameterized algorithms and the complexity of edge modification by Crespelle, Christophe, Drange, Pål Grønås, Fomin, Fedor V., Golovach, Petr

“…The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems…”
Get full text

Parameterized Algorithms for Graph Partitioning Problems by Shachnai, Hadas, Zehavi, Meirav

“…We study a broad class of graph partitioning problems. Each problem is defined by two constants, α 1 and α 2…”
Get full text

Parameterized Graph Algorithms and Their Role in Static Program Analysis by Kobus Conrado, Giovanna

“…Software systems are designed with trade-offs in mind; accuracy versus runtime, security versus feasibility, provable algorithms versus tested heuristics…”
Get full text

Parameterized algorithms on geometric intersection graphs by Xue, Jie, Zehavi, Meirav

“…We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs…”
Get full text

Deterministic parameterized algorithms for the Graph Motif problem by Pinter, Ron Y., Shachnai, Hadas, Zehavi, Meirav

“… Previous algorithms for Graph Motif and its variants either rely on techniques for developing randomized algorithms that − if derandomized…”
Get full text

Parameterized algorithms for multi-label periodic temporal graph realization by Erlebach, Thomas, Morawietz, Nils, Wolf, Petra

“…In the periodic temporal graph realization problem introduced by Klobas et al. [SAND '24] one is given a period…”
Get full text

Faster approximation schemes and parameterized algorithms on (odd-) H -minor-free graphs by Tazari, Siamak

“…]. We use these algorithms to derive faster 2-approximations; furthermore, we present the first PTASes and subexponential FPT-algorithms for independent set and vertex cover on these graph classes using a novel dynamic programming technique…”
Get full text

Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs by Fomin, Fedor V., Golovach, Petr A.

“… k . It appears that a number of fundamental intractable optimization problems being parameterized by k admit subexponential algorithms on graphs from C H O R D A L - k e…”
Get full text

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs by Dorn, Frederic, Fomin, Fedor V., Lokshtanov, Daniel, Raman, Venkatesh, Saurabh, Saket

“… We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs…”
Get full text

Faster Parameterized Algorithms for Deletion to Split Graphs by Ghosh, Esha, Kolay, Sudeshna, Kumar, Mrinal, Misra, Pranabendu, Panolan, Fahad, Rai, Ashutosh, Ramanujan, M. S.

“… We initiate a systematic study of parameterized complexity of the problem of deleting the minimum number of vertices or edges from a given input graph so that the resulting graph is split…”
Get full text

Efficient Parameterized Algorithms on Structured Graphs by Nelles, Florian

“…In classical complexity theory, the worst-case running times of algorithms depend (solely…”
Get full text

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity by Conrado, Giovanna Kobus, Goharshady, Amir Kafshdar, Motwani, Harshit Jitendra, Novozhilov, Sergei

“…We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekulé structures, (ii) the Hosoya index, (iii) the Merrifield–Simmons index, and (iv…”
Get full text

Graph Motif Problems Parameterized by Dual by Fertin, Guillaume, Komusiewicz, Christian

“… $\rm GM$, $\rm CGM$, and $\rm LGM$, parameterized by the dual parameter $\ell:=|V|-|M|$. For general graphs, we show that, assuming…”
Get full text

On the Parameterized Complexity of Layered Graph Drawing: Parameterized and Exact Algorithms by DUJMOVIC, Vida, FELLOWS, Michael R, KITCHING, Matthew, LIOTTA, Giuseppe, MCCARTIN, Catherine, NISHIMURA, Naomi, RAGDE, Prabhakar, ROSAMOND, Frances, WHITESIDES, Sue, WOOD, David R

Get full text

Improved Algorithms and Complexity Results for Power Domination in Graphs: Parameterized and Exact Algorithms by JIONG GUO, NIEDERMEIER, Rolf, RAIBLE, Daniel

Get full text

Structurally parameterized d-scattered set by Katsikarelis, Ioannis, Lampis, Michael, Paschos, Vangelis Th

“… In particular, we show the following: •For any d≥2, an O∗(dtw)-time algorithm, where tw is the treewidth of the input graph and a tight SETH-based lower bound matching this algorithm’s performance…”
Get full text

Alliances in graphs: Parameterized algorithms and on partitioning series -parallel graphs by Enciso, Rosa I

“… The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in [KHH04…”
Get full text

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling by Bengali, Vedangi, Veldt, Nate

“… We present faster approximation algorithms for an NP-hard parameterized clustering framework called LambdaCC, which is governed by a tunable resolution parameter and generalizes many other clustering…”
Get full text