A dichotomy for weighted efficient dominating sets with bounded degree vertices

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	A dichotomy for weighted efficient dominating sets with bounded degree vertices
Authors:	ID Brandstädt, Andreas (Author) ID Milanič, Martin (Author)
Files:	https://www.sciencedirect.com/science/article/pii/S002001901830200X?via%3Dihub
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms
Year of publishing:	2019
Number of pages:	str. 30-34
Numbering:	#Vol. #142
PID:	20.500.12556/RUP-10060
UDC:	519.17
ISSN on article:	0020-0190
DOI:	10.1016/j.ipl.2018.10.007
COBISS.SI-ID:	1540954052
Publication date in RUP:	21.01.2019
Views:	2496
Downloads:	285
Metadata:
:	BRANDSTÄDT, Andreas and MILANIČ, Martin, 2019, A dichotomy for weighted efficient dominating sets with bounded degree vertices. Information processing letters [online]. 2019. Vol. 142, p. 30–34. [Accessed 5 April 2025]. DOI 10.1016/j.ipl.2018.10.007. Retrieved from: https://www.sciencedirect.com/science/article/pii/S002001901830200X?via%3Dihub Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Information processing letters
Shortened title:	Inf. process. lett.
Publisher:	North-Holland
ISSN:	0020-0190
COBISS.SI-ID:	25612800

Language:	English
Keywords:	kriptografija, Boolove funkcije, zakrivljene funkcije, pol-zakrivljene funkcije, derivati, utežena učinkovita dominacija, točke omejene stopnje, k-omejena utežena učinkovita dominacija, algoritem polinomske časovne zahtevnosti, algoritmi na grafih

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back