Author:
Joeris Benson L.,Lundberg Scott,McConnell Ross M.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Bouchet, A.: Digraph decompositions and eulerian systems. SIAM Journal on Algebraic and Discrete Methods 8 (1987)
3. Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods 3, 214–228 (1982)
4. Dahlhaus, E.: Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition. Journal of Algorithms 36, 205–240 (2000)
5. Gabor, C.P., Supowit, K.J., Hsu, W.-L.: Recognizing circle graphs in polynomial time. Journal of the ACM 36, 435–473 (1989)