2283 search results - page 25 / 457 » Bounds of Graph Characteristics |
89
Voted
SIAMDM
2000
15 years 1 months ago
2000
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
132
click to vote
JGAA
1998
15 years 1 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
143
Voted
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
119
Voted
SIAMDM
2010
14 years 8 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
101
click to vote
MFCS
1995
Springer
15 years 5 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...