A faster parameterized algorithm for bipartite 1-sided vertex explosion

DOI10.1007/978-3-031-49614-1_19MaRDI QIDQ6606237zbMATH OpenFDO

Authors Yunlong Liu, Guang Xiao, Ao Liu, Di Wu, Jingui Huang

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49614-1_19

zbMATH Keywords

branchingkernelplanar embeddingvertex explosion

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• Automated generation of search tree algorithms for hard graphs modification problems
• Complexity and parameterized algorithms for cograph editing
• Edge crossings in drawings of bipartite graphs
• Edge deletion problems: branching facilitated by modular decomposition
• On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
• Parameterized algorithms
• Parameterized algorithms for queue layouts
• Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1

Cited in

(1)

• Parameterized algorithms for planar 2-layer drawing by vertex splitting on a given subset

This page was built for publication: A faster parameterized algorithm for bipartite 1-sided vertex explosion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606237)