Linear-time computability of combinatorial problems on series-parallel graphs (Q3945592): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q29041672, #quickstatements; #temporary_batch_1711055989931 |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Takao Nishizeki / rank | |||
| Property / author | |||
| Property / author: Takao Nishizeki / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322326.322328 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003021478 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29041672 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:29, 22 March 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
