Refine
Document Type
- Master's Thesis (1)
Year of publication
- 2021 (1)
Language
- English (1)
Keywords
- Graphentheorie (1)
Institute
Several algorithms have been proposed for the testing of series-parallel graphs in linear time. We give our alternate algorithms for testing series-parallel graphs, their tree decompositions, and the independence number when the input is undirected biconnected series-parallel graphs, which run (approximately) linearly in polynomial time.