534 search results - page 43 / 107 » Diameter critical graphs |
164
click to vote
ICDE
2008
IEEE
16 years 11 days ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
101
click to vote
ICDCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
ICPP
1991
IEEE
15 years 2 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
137
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
FPL
2007
Springer
15 years 24 days ago
2007
Springer
Reconfiguration time in dynamically-reconfigurable modular systems can severely limit application run-time compared to the critical path delay. In this paper we present a novel ...