Skip to search formSkip to main contentSkip to account menu

Discrete Mathematics & Theoretical Computer Science

Discrete Mathematics & Theoretical Computer Science is a peer-reviewed open access scientific journal covering discrete mathematics and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
AlgorithmicaComputer scienceDiscrete mathematicsJournal Citation Reports

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The Randomized Greedy Modularity Clustering Algorithm and the Core Groups Graph Clustering Scheme
The modularity measure of Newman and Girvan is a popular formal cluster criterium for graph clustering. Although the modularity… 
2007
2007
Discrete Mathematics (Series in Discrete Mathematics & Theoretical Computer Science) (Series in Discrete Mathematics & Theoretical Computer Science)
1997
1997
Discrete mathematics & theoretical computer science : DMTCS.
1995
1995
Explicit dispersers with polylog degree
An (N, M, ‘T)-disperser is a duected bipartite Multigraph G = (V, W,E) with IV[ = N, IW[ = M and all edges directed from V to W… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)