Sciweavers

2487 search results - page 428 / 498
» Partitions of Graphs into Trees
Sort
View
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 6 months ago
Edge-Injective and Edge-Surjective Vertex Labellings
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, F...
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 6 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
INFOCOM
2010
IEEE
13 years 5 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...
JCSS
2011
95views more  JCSS 2011»
13 years 3 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
SDM
2012
SIAM
238views Data Mining» more  SDM 2012»
11 years 10 months ago
Evaluating Event Credibility on Twitter
Though Twitter acts as a realtime news source with people acting as sensors and sending event updates from all over the world, rumors spread via Twitter have been noted to cause c...
Manish Gupta, Peixiang Zhao, Jiawei Han