Abstract
Computations of transitive closure and reduction of directed acyclic graphs are mainly considered in this paper. Classes of directed acyclic graphs for which such problems can be solved in linear time complexity (in accordance with the number of arcs) are proposed, namely: generalized N-free graphs, graphs such that the external or internal degree of any vertex is bounded in the transitive reduction, and bounded decomposition width orders, strongly W-free orders. For this purpose, we study the worst-case complexity of a nice algorithm. This algorithm is due to Goralcikova and Koubek (1979) and already studied by Mehlhorn (1984) and Simon (1988). Furthermore, two new classes of orders (generalized N-free and strongly W-free) which seem to have nice computational properties, are proposed and studied.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
