Fast algorithms for the dominating set problem on permutation graphs (Q2366239): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding a minimum independent dominating set in a permutation graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On domination problems for permutation and other graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Domination in permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank | |||
Normal rank | |||
Revision as of 18:10, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for the dominating set problem on permutation graphs |
scientific article |
Statements
Fast algorithms for the dominating set problem on permutation graphs (English)
0 references
29 June 1993
0 references
dominating set problem
0 references
permutation graphs
0 references
dynamic programming
0 references
data structures
0 references
