Výsledky vyhledávání - Parameterized graph algorithms

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

“… The multi-dimensional matrix product framework is useful in the design of parameterized graph algorithms…”
Získat plný text

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Autor 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…”
Získat plný text

A survey of parameterized algorithms and the complexity of edge modification Autor 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…”
Získat plný text

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

“…We study a broad class of graph partitioning problems. Each problem is defined by two constants, α 1 and α 2…”
Získat plný text

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

“…Software systems are designed with trade-offs in mind; accuracy versus runtime, security versus feasibility, provable algorithms versus tested heuristics…”
Získat plný text

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

“…We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs…”
Získat plný text

Deterministic parameterized algorithms for the Graph Motif problem Autor 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…”
Získat plný text

Parameterized algorithms for multi-label periodic temporal graph realization Autor 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…”
Získat plný text

Faster approximation schemes and parameterized algorithms on (odd-) H -minor-free graphs Autor 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…”
Získat plný text

Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs Autor 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…”
Získat plný text

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs Autor 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…”
Získat plný text

Faster Parameterized Algorithms for Deletion to Split Graphs Autor 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…”
Získat plný text

Efficient Parameterized Algorithms on Structured Graphs Autor Nelles, Florian

“…In classical complexity theory, the worst-case running times of algorithms depend (solely…”
Získat plný text

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity Autor 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…”
Získat plný text

Graph Motif Problems Parameterized by Dual Autor 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…”
Získat plný text

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

Získat plný text

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

Získat plný text

Structurally parameterized d-scattered set Autor 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…”
Získat plný text

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

“… The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in [KHH04…”
Získat plný text

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling Autor 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…”
Získat plný text