Tree-edges deletion problems with bounded diameter obstruction sets

DOI10.1016/j.dam.2006.10.016zbMath1118.05091OpenAlexW2068325774MaRDI QIDQ2370427

Dekel Tsur

Publication date: 26 June 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.10.016

zbMATH Keywords

graph algorithmssubgraph isomorphism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the approximability of the maximum agreement subtree and maximum compatible tree problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval graphs and maps of DNA
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Easy problems for tree-decomposable graphs
• Linear-time computability of combinatorial problems on series-parallel graphs
• An algebraic theory of graph reduction
• Linear-time computation of optimal subgraphs of decomposable graphs
• A combinatorial and logical approach to linear-time computability (extended abstract)

This page was built for publication: Tree-edges deletion problems with bounded diameter obstruction sets