Linear-time computability of combinatorial problems on series-parallel graphs (Q3945592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time computability of combinatorial problems on series-parallel graphs |
scientific article; zbMATH DE number 3763306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time computability of combinatorial problems on series-parallel graphs |
scientific article; zbMATH DE number 3763306 |
Statements
Linear-time computability of combinatorial problems on series-parallel graphs (English)
0 references
1982
0 references
edge-deletion problem
0 references
forbidden graph
0 references
generalized matching problem
0 references
series-parallel graph
0 references
vertex-deletion problem
0 references
planar graphs
0 references
decision problem
0 references
minimum vertex cover problem
0 references
maximum outerplanar subgraph problem
0 references
minimum feedback vertex set problem
0 references
maximum line-subgraph problem
0 references
maximum matching problem
0 references
maximum disjoint triangle problem
0 references
