4009 search results - page 106 / 802 » Clustering on Complex Graphs |
143
Voted
RTA
2010
Springer
15 years 7 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
146
Voted
COMSWARE
2006
IEEE
15 years 9 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
148
Voted
CC
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
154
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
120
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...