Dominators in Directed Graphs: A Survey of Recent Results,
Applications, and Open Problems

dc.contributor.author	Parotsidis, Nikos
dc.contributor.author	Georgiadis, Loukas
dc.date.accessioned	2013-12-19T13:32:07Z
dc.date.accessioned	2015-11-19T12:50:26Z
dc.date.available	2013-12-19T13:32:07Z
dc.date.available	2015-11-19T12:50:26Z
dc.date.issued	2013-12-19
dc.identifier.uri	http://dspace.epoka.edu.al/handle/1/836
dc.description.abstract	The computation of dominators is a central tool in program optimization and code generation, and it has applications in other diverse areas includingconstraint programming, circuit testing, and biology. In this paper we survey recent results, applications, and open problems related to the notion of dominators in directed graphs,including dominator verification and certification, computing independent spanning trees, and connectivity and path-determination problems in directed graphs.	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	paper_29;
dc.subject	graphs	en_US
dc.subject	dominators	en_US
dc.title	Dominators in Directed Graphs: A Survey of Recent Results, Applications, and Open Problems	en_US
dc.type	Book chapter	en_US

Files in this item

Name: paper_29.pdf

Size: 89.73Kb

Format: PDF

ISCIM 2013
2nd International Symposium on Computing in Informatics and Mathematics