An algorithm for outerplanar graphs with parameter

DOI10.1016/0196-6774(91)90038-ZMaRDI QIDQ3988826zbMATH OpenOpenAlexFDO

Authors Binghuan Zhu, Wayne Goddard

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(91)90038-z

zbMATH Keywords

number of breakpointsparametrized independence problemupper bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 24420
• An algorithm for the maximum weight independent set problem on outerstring graphs
• Independent domination in outerplanar graphs
• scientific article; zbMATH DE number 2163938
• Parametric problems on graphs of bounded tree-width

Cited in

(5)

• Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
• scientific article; zbMATH DE number 24420 (Why is no real title available?)
• A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
• scientific article; zbMATH DE number 841998 (Why is no real title available?)
• Parametric problems on graphs of bounded tree-width

This page was built for publication: An algorithm for outerplanar graphs with parameter

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