Tree-decompositions of small pathwidth

DOI10.1016/S1571-0653(04)00410-XzbMATH Open1184.05126OpenAlexW2175868772MaRDI QIDQ5899355FDOQ5899355

Authors: Jan Arne Telle 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00410-x

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Complexity of Finding Embeddings in a k-Tree
• Title not available (Why is that?)
• Representation of a finite graph by a set of intervals on the real line
• Title not available (Why is that?)
• Triangulating graphs without asteroidal triples
• Triangulating multitolerance graphs
• All structured programs have small tree width and good register allocation
• Memory requirements for table computations in partial \(k\)-tree algorithms

Cited In (1)

• Tree decompositions with small cost

This page was built for publication: Tree-decompositions of small pathwidth

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