On hereditary efficiently dominatable graphs

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	On hereditary efficiently dominatable graphs
Authors:	ID Milanič, Martin (Author)
Files:	http://drops.dagstuhl.de/opus/volltexte/2011/3202/pdf/dagrep_v001_i005_p029_s11182.pdf
Language:	English
Work type:	Not categorized
Typology:	1.12 - Published Scientific Conference Contribution Abstract
Organization:	IAM - Andrej Marušič Institute
Keywords:	popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes
Year of publishing:	2011
Number of pages:	str. 34
Numbering:	Vol. 1, iss. 5
PID:	20.500.12556/RUP-7107
ISSN:	2192-5283
UDC:	519.17
COBISS.SI-ID:	1537135300
Publication date in RUP:	15.10.2015
Views:	4660
Downloads:	272
Metadata:
:	MILANIČ, Martin, 2011, On hereditary efficiently dominatable graphs. In : [online]. Published Scientific Conference Contribution Abstract. 2011. [Accessed 9 April 2025]. Retrieved from: http://drops.dagstuhl.de/opus/volltexte/2011/3202/pdf/dagrep_v001_i005_p029_s11182.pdf 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:

No similar works found

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.

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back