Sciweavers

2310 search results - page 325 / 462
» Coloring Random Graphs
Sort
View
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
BMCBI
2005
120views more  BMCBI 2005»
13 years 8 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
11 years 10 months ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...
ICML
2008
IEEE
14 years 8 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang