scientific article; zbMATH DE number 7651203

DOI10.4230/LIPICS.ESA.2020.64MaRDI QIDQ5874536FDOQ5874536

Authors: Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos 

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

pathwidthgraph decompositionsparameterized algorithmsgraph searchingtypical sequences

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Graph minors. XX: Wagner's conjecture
• Searching and pebbling
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Complexity of Finding Embeddings in a k-Tree
• An annotated bibliography on guaranteed graph searching
• Title not available (Why is that?)
• Constructive linear time algorithms for branchwidth
• Graph minors. I. Excluding a forest
• The vertex separation number of a graph equals its path-width
• From pathwidth to connected pathwidth
• Parameterized and Exact Computation
• Searching is not jumping.
• Connected graph searching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalent definitions of recognizability for sets of graphs of bounded tree-width
• Interval graphs and searching
• Cutwidth I: A linear time fixed parameter algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Derivation of algorithms for cutwidth and related graph layout parameters
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Constructive algorithm for path-width of matroids
• Title not available (Why is that?)
• Finding small-width connected path decompositions in polynomial time
• Connected Search for a Lazy Robber
• Title not available (Why is that?)
• The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
• Faster computation of path-width
• Finding branch-decompositions of matroids, hypergraphs, and more
• Title not available (Why is that?)

Cited In (4)

• Improved FPT Algorithms for Rectilinear k-Links Spanning Path
• A Polynomial Time Algorithm for Bounded Directed Pathwidth
• Connected search for a lazy robber
• Fixed-parameter tractable algorithms for tracking shortest paths

This page was built for publication:

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