Sciweavers

990 search results - page 132 / 198
» Sub-Graphs of Complete Graph
Sort
View
142
Voted
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
15 years 9 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
164
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
130
Voted
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 8 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
15 years 3 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky
CIKM
2009
Springer
15 years 10 months ago
On optimising personal network size to manage information flow
PN refer to the set of ties a specific individual has with other people. There is significant variation in the size of an individual’s PN and this paper explores the effect o...
Yu-En Lu, Sam Roberts, Tammy M. K. Cheng, Robin Du...