scientific article; zbMATH DE number 512913

zbMath0789.68105MaRDI QIDQ4281625

Andreas Brandstädt

Publication date: 10 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingpermutation graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Related Items (10)

The size of graphs with given feedback vertex number ⋮ A linear-time algorithm for the weighted feedback vertex problem on interval graphs ⋮ On the feedback vertex set problem in permutation graphs ⋮ A feedback vertex set of 2-degenerate graphs ⋮ Domination number and feedback vertex number of complements of line graphs ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs ⋮ Minimum feedback vertex set and acyclic coloring.

This page was built for publication: