Sciweavers

649 search results - page 56 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
JDA
2006
83views more  JDA 2006»
13 years 8 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
ICALP
2009
Springer
14 years 9 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
FSTTCS
2009
Springer
14 years 1 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
IJSNET
2007
95views more  IJSNET 2007»
13 years 8 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...
PR
2010
145views more  PR 2010»
13 years 7 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen