A linear algorithm for the domination number of a series-parallel graph (Q1837213): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5537621 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear algorithm for the domination number of a tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dividing a Graph into Triconnected Components / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum domination in weighted trees / rank | |||
Normal rank |
Revision as of 17:16, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear algorithm for the domination number of a series-parallel graph |
scientific article |
Statements
A linear algorithm for the domination number of a series-parallel graph (English)
0 references
1983
0 references
domination number
0 references
series-parallel decomposition
0 references