Fast approximation of centrality. Eppstein, David, Wang, Joseph (2004) Journal of Graph Algorithms and Applications
Few colored cuts or cycles in edge colored graphs Jiří Matoušek (1988) Commentationes Mathematicae Universitatis Carolinae
Finding induced acyclic subgraphs in random digraphs. Subramanian, C.R. (2003) The Electronic Journal of Combinatorics [electronic only]