Fast approximation of centrality.
Page 1
Displaying 1 – 4 of 4
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]
Finite-size scaling in percolation.
Chayes, J.T. (1998)
Documenta Mathematica
Currently displaying 1 – 4 of 4
Page 1