Sciweavers

4171 search results - page 359 / 835
» Choice numbers of graphs
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 7 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
15 years 1 months ago
Effect of network structure on the stability margin of large vehicle formation with distributed control
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
He Hao, Prabir Barooah, J. J. P. Veerman
WWW
2007
ACM
16 years 7 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
STACS
2007
Springer
16 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...