On finding a minimum vertex cover of a series-parallel graph (Q758196): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of comparability graph recognition and coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3315556 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Recognition of Series Parallel Digraphs / rank | |||
Normal rank | |||
Latest revision as of 16:07, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding a minimum vertex cover of a series-parallel graph |
scientific article |
Statements
On finding a minimum vertex cover of a series-parallel graph (English)
0 references
1989
0 references
linear time algorithm
0 references
minimum vertex cover for series-parallel graphs
0 references
