Combinatorial problems on series-parallel graphs

DOI10.1016/0166-218X(81)90031-7zbMath0452.68070OpenAlexW1982775314MaRDI QIDQ1148685

Nobuji Saito, Takao Nishizeki, K. Takamizawa

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

series-parallel graphslinear time algorithms

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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