Connected domination and Steiner set on weighted permutation graphs

Authors:
K. Arvind;C. Pandu Regan
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1992

Citing 0
Cited 2

Teaching dynamic programming techniques using permutation graphs

SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
A polynomial-time algorithm for the paired-domination problem on permutation graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract