Parameterized complexity of set-restricted disjoint paths on chordal graphs
type: Item
instance of: scholarly article
title: Parameterized complexity of set-restricted disjoint paths on chordal graphs
DOI: 10.1007/978-3-031-09574-0_10
author: Fahad Panolan
author: Ashutosh Rai
author: Saket Saurabh
author: Petr A. Golovach
publication date: 2022-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7615736
zbMATH Keywords: chordal graphs
zbMATH Keywords: disjoint paths
zbMATH Keywords: set restricted disjoint paths
zbMATH Keywords: fpt
zbMATH Keywords: kernel
MaRDI profile type: Publication
full work available at URL: 978-3-031-09574-0 10
OpenAlex ID: W4285124465
cites work: Irrelevant vertices for the planar disjoint paths problem
cites work: Well-partitioned chordal graphs: obstruction set and disjoint paths
cites work: Detecting fixed patterns in chordal graphs in polynomial time
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Parameterized Algorithms
cites work: Hitting topological minors is FPT
cites work: Kernelization
cites work: Q3328583
cites work: Finding topological subgraphs is fixed-parameter tractable
cites work: The k-Disjoint Paths Problem on Chordal Graphs
cites work: An exponential time parameterized algorithm for planar disjoint paths
cites work: Graph minors. XIII: The disjoint paths problem
description: scientific article; zbMATH DE number 7615736