Sciweavers

3267 search results - page 85 / 654
» Generalized quasirandom graphs
Sort
View
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
15 years 5 months ago
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
Javier Esparza, Petr Jancar, Alexander Miller
SPAA
2005
ACM
15 years 4 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
APVIS
2006
15 years 17 days ago
Mental map preserving graph drawing using simulated annealing
Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are `dynamic' in the sense that...
Yi-Yi Lee, Chun-Cheng Lin, Hsu-Chun Yen
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
15 years 15 days ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
EJC
2010
14 years 11 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...