scientific article; zbMATH DE number 7650942

DOI10.4230/LIPICS.STACS.2020.57MaRDI QIDQ5874334FDOQ5874334

Authors: Lars Jaffke, Jan Arne Telle, Hans L. Bodlaender 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1905.03643

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

Recommendations

• Typical sequences revisited -- computing width parameters of graphs
• Characterizations and directed path-width of sequence digraphs
• On digraph width measures in parameterized algorithmics
• Approximating degree sequences with regular graphic sequences (extended abstract)
• Directed path-width of sequence digraphs
• Digraph width measures in parameterized algorithmics
• A generic framework for computing parameters of sequence-based dynamic graphs
• Computing parameters of sequence-based dynamic graphs
• Parameterized Approximation Schemes Using Graph Widths
• Approximation algorithms for digraph width parameters

zbMATH Keywords

treewidthcutwidthmodified cutwidthseries parallel digraphstypical sequences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (4)

• A linear fixed parameter tractable algorithm for connected pathwidth
• Edge-treewidth: algorithmic and combinatorial properties
• Title not available (Why is that?)
• An improved parameterized algorithm for treewidth

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 Q5874334)