Sciweavers

4865 search results - page 299 / 973
» The Complexity of Graph Connectivity
Sort
View
FCT
1991
Springer
15 years 10 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
BIOSYSTEMS
2007
175views more  BIOSYSTEMS 2007»
15 years 6 months ago
Alternative routes and mutational robustness in complex regulatory networks
Alternative pathways through a gene regulation network connect a regulatory molecule to its (indirect) regulatory target via different intermediate regulators. We here show for tw...
Andreas Wagner, Jeremiah Wright
SPRINGSIM
2010
15 years 5 months ago
GTNA: a framework for the graph-theoretic network analysis
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
FOCS
2009
IEEE
16 years 1 months ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
16 years 1 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala