Ordered Vertex Partitioning
2000 ◽
Vol Vol. 4 no. 1
◽
Keyword(s):
International audience A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modular decomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems. In this paper, we describe a simple O(n + m \log n) algorithm that uses this duality to find both a transitive orientation and the modular decomposition. Though the running time is not optimal, this algorithm is much simpler than any previous algorithms that are not Ω (n^2). The best known time bounds for the problems are O(n+m) but they involve sophisticated techniques.
2010 ◽
Vol DMTCS Proceedings vol. AM,...
(Proceedings)
◽
Keyword(s):
1999 ◽
Vol 201
(1-3)
◽
pp. 189-241
◽
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2012 ◽
Vol Vol. 14 no. 1
(Graph and Algorithms)
◽
2005 ◽
Vol DMTCS Proceedings vol. AD,...
(Proceedings)
◽
A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
2014 ◽
Vol Vol. 16 no. 1
(Discrete Algorithms)
◽
2012 ◽
Vol Vol. 14 no. 2
(Analysis of Algorithms)
◽
2011 ◽
Vol Vol. 13 no. 2
(Graph and Algorithms)
◽