2283 search results - page 175 / 457 » Bounds of Graph Characteristics |
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
JSAC
2006
13 years 8 months ago
2006
Abstract--This work presents a channel model for the broadband characterization of power lines in presence of time variation of the loads. The model is characterized by taking into...
GD
1998
Springer
14 years 14 days ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
GD
2008
Springer
13 years 9 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...