Sciweavers

4009 search results - page 132 / 802
» Clustering on Complex Graphs
Sort
View
TAMC
2010
Springer
15 years 9 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
ACID
2006
237views Algorithms» more  ACID 2006»
15 years 5 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos
ICDAR
2011
IEEE
14 years 3 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
COLOGNETWENTE
2010
15 years 2 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey
FSEN
2009
Springer
15 years 10 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas