Sciweavers

522 search results - page 75 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
ICALP
2007
Springer
15 years 9 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
TKDE
2008
121views more  TKDE 2008»
15 years 2 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 2 months ago
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
Pascal Pons
GCB
2009
Springer
193views Biometrics» more  GCB 2009»
15 years 6 months ago
Integration and Visualisation of Multimodal Biological Data
: Understanding complex biological systems requires data from manifold biological levels. Often this data is analysed in some meaningful context, for example, by integrating it int...
Hendrik Rohn, Christian Klukas, Falk Schreiber
CSUR
1999
159views more  CSUR 1999»
15 years 2 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg