2022
DOI: 10.1007/978-3-031-15914-5_1
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Roman Dominating Functions: Extensions and Enumeration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(9 citation statements)
references
References 42 publications
0
9
0
Order By: Relevance
“…Notice that the analysis of the recursion is very simple: an rdf f is gradually defined, and the branching vectors describe the number of newly defined vertices. The worst-case branching vector is (1,3), which leads to the following claim.…”
Section: When All Elements Ofmentioning
confidence: 98%
See 4 more Smart Citations
“…Notice that the analysis of the recursion is very simple: an rdf f is gradually defined, and the branching vectors describe the number of newly defined vertices. The worst-case branching vector is (1,3), which leads to the following claim.…”
Section: When All Elements Ofmentioning
confidence: 98%
“…A vertex leftmost in V is simply called leftmost. Notice that this notion of a leftmost vertex will be used in many places in the rules exhibited in the following and is not available in the setting of general graphs as investigated in [3] but relies on the interval graph structure. Our algorithm always branches on the leftmost vertex.…”
Section: Enumerating Minimal Rdfs On Interval Graphs and Forestsmentioning
confidence: 99%
See 3 more Smart Citations