Sciweavers

136 search results - page 10 / 28
» Crossing and Weighted Crossing Number of Near-Planar Graphs
Sort
View
ACL
2010
13 years 5 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum
IAJIT
2011
12 years 11 months ago
On the genus of pancake network
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
Quan T. Nguyen, Saïd Bettayeb
GD
2006
Springer
13 years 11 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
13 years 7 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
14 years 1 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim