Sciweavers

1199 search results - page 121 / 240
» Graph Theory
Sort
View
152
Voted
TSMC
2010
14 years 10 months ago
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
Wenwu Yu, Guanrong Chen, Ming Cao, Jürgen Kur...
PODC
2010
ACM
15 years 8 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 5 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
AML
2007
68views more  AML 2007»
15 years 4 months ago
A note on weak dividing
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
Byunghan Kim, Niandong Shi
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 4 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...