1671 search results - page 132 / 335 » Hierarchical graph maps |
141
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
104
Voted
SPAA
1997
ACM
15 years 7 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
154
Voted
DAC
2007
ACM
16 years 4 months ago
2007
ACM
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
114
click to vote
ICCAD
2005
IEEE
16 years 12 days ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
164
Voted
FGCS
2011
14 years 10 months ago
2011
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...