A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90163-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059231566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithms for domination problems in sun-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted perfect domination problem / rank
 
Normal rank

Latest revision as of 16:03, 22 May 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
scientific article

    Statements

    A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (English)
    0 references
    0 references
    0 references
    1994
    0 references
    parsing tree
    0 references
    weighted perfect domination problem
    0 references
    series-parallel graphs
    0 references
    NP-complete
    0 references
    linear time algorithm
    0 references

    Identifiers