Sciweavers

3267 search results - page 204 / 654
» Generalized quasirandom graphs
Sort
View
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
15 years 10 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
CP
2008
Springer
15 years 8 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
180
Voted
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 6 months ago
De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
Abbas Alhakim, Mufutau Akinwande
JCT
2006
46views more  JCT 2006»
15 years 6 months ago
Optimal tristance anticodes in certain graphs
For z1, z2, z3 Zn, the tristance d3(z1, z2, z3) is a generalization of the L1-distance on Zn to a quantity that reflects the relative dispersion of three points rather than two. ...
Tuvi Etzion, Moshe Schwartz, Alexander Vardy
JOLLI
2006
86views more  JOLLI 2006»
15 years 6 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan