scientific article; zbMATH DE number 512913

MaRDI QIDQ4281625zbMATH OpenFDO

Authors Andreas Brandstädt

Publication date 10 March 1994

zbMATH Keywords

dynamic programmingpermutation graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3943870
• On the feedback vertex set problem in permutation graphs
• On domination problems for permutation and other graphs
• Domination in permutation graphs

Cited in

(14)

• On domination problems for permutation and other graphs
• On the feedback vertex set problem in permutation graphs
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Minimum feedback vertex set and acyclic coloring.
• The size of graphs with given feedback vertex number
• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
• A feedback vertex set of 2-degenerate graphs
• Some Efficient Algorithms for Permutation Graphs
• A space-time tradeoff for permutation problems
• Domination number and feedback vertex number of complements of line graphs
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• Maximum bipartite subgraphs of geometric intersection graphs

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