Sciweavers

296 search results - page 28 / 60
» Group connectivity of certain graphs
Sort
View
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 2 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt
ICANN
2009
Springer
14 years 2 months ago
Spectra of the Spike Flow Graphs of Recurrent Neural Networks
Recently the notion of power law networks in the context of neural networks has gathered considerable attention. Some empirical results show that functional correlation networks in...
Filip Piekniewski
IWPEC
2010
Springer
13 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
SOFSEM
1997
Springer
13 years 11 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
14 years 1 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis