Labelling algorithms for paired-domination problems in block and interval graphs (Q987497): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paired domination on interval and circular-arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paired-domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with large paired-domination number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paired-domination of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paired-domination in generalized claw-free graphs / rank | |||
Normal rank |
Revision as of 01:43, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Labelling algorithms for paired-domination problems in block and interval graphs |
scientific article |
Statements
Labelling algorithms for paired-domination problems in block and interval graphs (English)
0 references
13 August 2010
0 references
algorithm
0 references
block graph
0 references
interval graph
0 references
paired-domination
0 references
NP-complete
0 references
0 references