1. DSpace at

Browsing by Subject Approximation algorithm

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 7 of 7
Issue DateTitleAuthor(s)
25-Jul-2018Algorithmic aspects of b-disjunctive domination in graphsPanda, B.S.; Pandey, A.; Paul, S.
7-Jul-2024Algorithmic aspects of paired disjunctive domination in graphsHenning, M.A; Pandey, A.; Tripathi, V.
2-Jan-2019Algorithmic aspects of semitotal domination in graphsHenning, M.A.; Pandey, A.
21-Aug-2021Algorithmic aspects of semitotal domination in graphsHenning, M. A.; Pandey, A.
3-Jul-2021Complexity and algorithms for semipaired domination in graphsHenning, M. A.; Pandey, A.; Tripathi, V.
28-Jun-2022Complexity of Paired Domination in AT-free and Planar GraphsTripathi, V.; Kloks, T.; Pandey, A.; Paul, K.; Wang, H.
3-Dec-2021Semitotal domination on AT-Free graphs and circle graphsKloks, T.; Pandey, A.
Showing results 1 to 7 of 7