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://www.dagstuhl.de/mat/index.en.phtml?11182
Language:	English
Work type:	Not categorized
Typology:	3.15 - Unpublished Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Year of publishing:	2011
PID:	20.500.12556/RUP-544
UDC:	51
COBISS.SI-ID:	1024340052
Publication date in RUP:	15.10.2013
Views:	3927
Downloads:	69
Metadata:
:	MILANIČ, Martin, 2011, On hereditary efficiently dominatable graphs. In : [online]. Unpublished Conference Contribution. 2011. [Accessed 9 April 2025]. Retrieved from: http://www.dagstuhl.de/mat/index.en.phtml?11182 Copy citation