Combinatorial problems on series-parallel graphs

DOI10.1016/0166-218X(81)90031-7MaRDI QIDQ1148685zbMATH OpenOpenAlexFDO

Authors K. Takamizawa, Takao Nishizeki, Nobuji Saito

Publication date 1981

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

Full work available at URL https://doi.org/10.1016/0166-218x(81)90031-7

zbMATH Keywords

linear time algorithmsseries-parallel graphs

Mathematics Subject Classification ID

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

Cites work

• Linear-time computability of combinatorial problems on series-parallel graphs

Cited in

(1)

• Practical algorithms for MSO model-checking on tree-decomposable graphs

This page was built for publication: Combinatorial problems on series-parallel graphs

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