Linear-time computability of combinatorial problems on series-parallel graphs (Q3945592): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q226821 |
Changed an Item |
||
| Property / author | |||
| Property / author: Takao Nishizeki / rank | |||
Normal rank | |||
Revision as of 13:44, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time computability of combinatorial problems on series-parallel graphs |
scientific article |
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
