Sciweavers

803 search results - page 121 / 161
» Independence in Direct-Product Graphs
Sort
View
SIGECOM
2004
ACM
86views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Mechanisms for a spatially distributed market
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...
Moshe Babaioff, Noam Nisan, Elan Pavlov
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
14 years 10 days ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
GD
2006
Springer
14 years 4 days ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren
AVI
2004
13 years 10 months ago
A graph-based interface to complex hypermedia structure visualization
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
Manuel Freire, Pilar Rodríguez