Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C22 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6378666 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph algorithms | |||
Property / zbMATH Keywords: graph algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
efficient domination | |||
Property / zbMATH Keywords: efficient domination / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
weighted efficient domination | |||
Property / zbMATH Keywords: weighted efficient domination / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dually chordal graph | |||
Property / zbMATH Keywords: dually chordal graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
AT-free graph | |||
Property / zbMATH Keywords: AT-free graph / rank | |||
Normal rank |
Revision as of 18:24, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs |
scientific article |
Statements
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (English)
0 references
9 December 2014
0 references
graph algorithms
0 references
efficient domination
0 references
weighted efficient domination
0 references
dually chordal graph
0 references
AT-free graph
0 references