2125 search results - page 258 / 425 » On Graph Complexity |
158
click to vote
WAW
2004
Springer
15 years 8 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
241
click to vote
LCC
1994
15 years 7 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
103
click to vote
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
127
click to vote
CSL
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
108
click to vote
SEMWEB
2005
Springer
15 years 8 months ago
2005
Springer
Recommender algorithms have been quite successfully employed in a variety of scenarios from filtering applications to recommendations of movies and books at Amazon.com. However, a...