Sciweavers

2270 search results - page 154 / 454
» On the distribution of eigenvalues of graphs
Sort
View
AAAI
2007
15 years 8 months ago
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet
WAW
2010
Springer
235views Algorithms» more  WAW 2010»
15 years 4 months ago
Multiplicative Attribute Graph Model of Real-World Networks
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
Myunghwan Kim, Jure Leskovec
ACIVS
2007
Springer
16 years 18 days ago
Joint Tracking and Segmentation of Objects Using Graph Cuts
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
Aurélie Bugeau, Patrick Pérez
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
IPPS
2008
IEEE
16 years 24 days ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri