990 search results - page 132 / 198 » Sub-Graphs of Complete Graph |
168
click to vote
IWDC
2005
Springer
15 years 11 months ago
2005
Springer
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...
193
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
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...
161
click to vote
WAW
2004
Springer
15 years 11 months ago
2004
Springer
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...
141
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
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 ...
133
click to vote
CIKM
2009
Springer
16 years 18 days ago
2009
Springer
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...