A linear algorithm for the domination number of a series-parallel graph (Q1837213): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127220198, #quickstatements; #temporary_batch_1722035971323
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / Wikidata QID
 
Property / Wikidata QID: Q127220198 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:23, 27 July 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
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    domination number
    0 references
    series-parallel decomposition
    0 references
    0 references